Springer is proud to introduce the official weblog of the Journal of Network and Systems Management, moderated by Editor-in-Chief Manu Malek. The journal’s homepage can be found on Springer.com, while the full-text can be found on SpringerLink.

by Zhang, Dengyin; Tang, Zhiyun; Wang, Ruchuan

Routing protocols can decide for data packets which route is reachable and co-optimal, and may cause data packets to swarm into certain links, thus causing congestion on those links. General traffic engineering (GTE) technology provides ER-LSP/CR-LSP in MPLS networks to avoid this kind of congestion. However, GTE takes only the current data flow into account and establishes an ER-LSP/CR-LSP for this current data flow in order to guarantee QoS. Although this could resolve the issue raised by routing protocols, it may also waste some resource. In this article we focus on optimization of traffic engineering and propose an automatic traffic balance algorithm based on GTE technology.

DOI: 10.1007/s10922-006-9034-9
Online Date: 7/22/2006
Print publication date: 9/1/2006
View article on SpringerLink

by Hellerstein, Joseph L.; Stiller, Burkhard

DOI: 10.1007/s10922-006-9032-y
Online Date: 7/21/2006
Print publication date: 9/1/2006
View article on SpringerLink

by Nazeeruddin, Mohammad; Parr, Gerard; Scotney, Bryan

MANETs are self-organizing infrastructure-less networks formed on the fly by a group of wireless nodes. The lack of central administration in these networks necessitates host auto-configuration. The proposed auto-configuration protocols to date are either not robust enough to respond efficiently to the dynamic nature of the MANETs or they are resource greedy. Also, there has been no detailed attempt made to compare the effectiveness of these protocols which is essential to judge relative merits and demerits. This paper presents a new stateful robust host auto-configuration protocol which is based on dynamically selected Address Agents (AAs) that maintain a distributed address table. The performance of the proposed protocol is comprehensively compared with a representative protocol that employs a different address table management technique.

DOI: 10.1007/s10922-006-9038-5
Online Date: 7/19/2006
Print publication date: 9/1/2006
View article on SpringerLink

by Aoun, Bassam; Boutaba, Raouf

Sensor networks have emerged as a revolutionary technology for querying the physical world and hold promise in a wide variety of applications. However, the extremely energy constrained nature of these networks necessitate that their architecture be designed in an energy-aware manner. Clustering is the architecture of choice as it keeps the traffic local; sensor nodes would send only to nearby cluster-head within a fixed radius, independent of the network size.In this paper we address the problem of clustering in WSNs, subject to upper bounds on the maximum latency, the energy consumed by intermediate nodes, and clusters size. Those constraints are necessary for the reliability of the system and for extending its lifetime. We propose a polynomial time algorithm consisting of recursively computing minimum weighted dominating sets, while respecting latency and energy consumption constraints. We compare our algorithm to other alternatives and show that it consistently outperforms them.

DOI: 10.1007/s10922-006-9039-4
Online Date: 7/12/2006
Print publication date: 9/1/2006
View article on SpringerLink

by Ulema, Mehmet; Nogueira, Jose Marcos; Kozbe, Barcin

DOI: 10.1007/s10922-006-9033-x
Online Date: 7/12/2006
Print publication date: 9/1/2006
View article on SpringerLink

by Albini, Luiz Carlos P.; Caruso, Antonio; Chessa, Stefano; Maestrini, Piero

A novel routing protocol for wireless, mobile ad hoc networks is presented. This protocol incorporates features that enhance routing reliability, defined as the ability to provide almost 100% packet delivery rate. The protocol is based on a virtual structure, unrelated to the physical network topology, where mobile nodes are connected by virtual links and are responsible for keeping physical routes to their neighbors in the virtual structure. Routes between pairs of mobiles are set up by using information to translate virtual paths discovered in the virtual structure. Route discovery and maintenance phases of the protocol are based on unicast messages travelling across virtual paths, with sporadic use of flooding protocol. Most flooding is executed in the background using low priority messages. The routing protocol has been evaluated and compared with the Dynamic Source Routing protocol and with the Zone Routing Protocol by means of simulation.

DOI: 10.1007/s10922-006-9035-8
Online Date: 7/7/2006
Print publication date: 9/1/2006
View article on SpringerLink

by Hou, Xiaobing; Tipper, David; Wu, Shuju

In this paper, we present an energy conservation scheme for wireless ad hoc and sensor networks using gossiping to place nodes in an energy saving sleep state. The technique is termed the Gossip-based Sleep Protocol (GSP). With GSP, each node randomly goes to sleep for some time with gossip sleep probability p. GSP is based on the observation that in a well connected network there are usually many paths between a source and destination, so a percentage of nodes can be in an energy conserving sleep mode without losing network connectivity. GSP needs few operations, scales to large networks and does not require a wireless node to maintain the states of other nodes. We propose two versions of GSP, one for synchronous networks and one for asynchronous networks, and afterward extend GSP to adapt to network traffic conditions. We show the advantages of the GSP approach through both simulations and analysis.

DOI: 10.1007/s10922-006-9037-6
Online Date: 7/7/2006
Print publication date: 9/1/2006
View article on SpringerLink

by Chen, Gilbert G.; Branch, Joel W.; Szymanski, Boleslaw K.

There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node’s delay of transmitting a signal is dependent on the probability of the node’s ability to best perform a pertinent task, and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding called Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.

DOI: 10.1007/s10922-006-9036-7
Online Date: 7/7/2006
Print publication date: 9/1/2006
View article on SpringerLink