A resource management scheme for satellite networks

Satellite networks with dynamic bandwidth allocation capabilities (DBAC) are based on classical circuit switches. The DBAC payload allows changing the capacity of each connection dynamically, without tearing down and setting up the connection. An analysis of our DBAC satellite system performance shows a significant increase in the overall utilization factor of our system compared to a plain circuit switching solution     

Variable power broadcast using local information in ad hoc networks

Network wide broadcast is a frequently used operation in ad hoc networks. Developing energy efficient protocols to reduce the overall energy expenditure in network wide broadcast can contribute toward increasing the longevity of ad hoc networks. Most of the existing work in energy efficient broadcast protocols use either a fixed transmission power model or assume global knowledge of the entire network at each node. Variable power broadcast with local knowledge has recently been proposed as a promising alternative approach for network wide broadcast in ad hoc networks.

In this paper, we present a novel approach, called INOP, for network wide broadcast. INOP is a variable power broadcast approach that uses local (two-hop neighborhood) information. INOP utilizes a novel technique for determining the transmission power level at each transmitting node. We also propose two alternative methods to cover the nodes that are not covered by the transmission of the source or a retransmitting node.

Our simulation based evaluations show that, compared to other approaches, INOP achieves better results in terms of energy efficiency, and competes with and exceeds other approaches in terms of a number of other performance metrics including traffic overhead, coverage, and convergence time. Based on these results, we can conclude that INOP improves the current state-of-the-art approaches for energy efficient broadcast in ad hoc networks.     

Explicit rate flow control for ABR services in ATM networks

We propose a novel explicit rate flow control algorithm intended for available-bit-rate (ABR) service on an ATM network subject to loss and fairness constraints. The goal is to guarantee low cell loss in order to avoid throughput collapse due to retransmission by higher level protocols. The mechanism draws on measuring the current queue length and bandwidth availability, as well as tracking the current number of active sessions contending for capacity, to adjust an explicit bound on the source transmission rates. We identify the factors that affect queue overflows and propose simple design rules aimed at achieving transmission with controlled loss in a dynamic environment. We also discuss how conservative design rules might be relaxed by accounting for statistical multiplexing in bandwidth sharing among bursty ABR sources and variable-bit-rate (VBR) sources     

Scalable flow control for multicast ABR services in ATM networks

We propose a flow-control scheme for multicast ABR services in ATM networks. At the heart of the proposed scheme is an optimal second-order rate control algorithm, called the α-control, designed to deal with the variation in RM-cell round-trip time (RTT) resulting from dynamic drift of the bottleneck in a multicast tree. Applying two-dimensional rate control, the proposed scheme makes the rate process converge to the available bandwidth of the connection's most congested link sensed by the traffic source. It also confines the buffer occupancy to a target regime bounded by a finite buffer capacity as the system enters the equilibrium state. It works well irrespective of the topology of the multicast tree. Using the fluid analysis, we model the proposed scheme and analyze the system dynamics for multicast ABR traffic. We study the convergence properties and derive the optimal-control conditions for the α-control. The analytical results show that the scheme is stable and efficient in the sense that both the source rate and bottleneck queue length rapidly converge to a small neighborhood of the designated operating point. We present simulation results which verify the analytical observations. The simulation experiments also demonstrate the superiority of the proposed scheme to the other schemes in dealing with RM-cell RTT and link-bandwidth variations, achieving fairness in both buffer and bandwidth occupancies, and enhancing average throughput     

A power-sharing multiple-beam mobile satellite in Ka band

This paper presents a new power-sharing multiple-beam mobile satellite system concept in the Ka band. A wide allocated bandwidth and a large amount of frequency reuse based on hundreds to thousands of small spot beams will allow us to draw a drastically new mobile satellite systems concept in the Ka band. At first, requirements for beam size on the surface of the Earth for various signal transmissions are considered. Based on these requirements, Ka band geostationary systems with 3.5 and 10 m satellite antennas are shown. If the number of beams is hundreds to thousands, it is not appropriate to assume a fixed power transmitter for each beam because the traffic in each beam is not uniform or static. In order to cope with this multiple-beam-varying traffic problem, this paper proposes a new type offset reflector antenna fed through an equal phase-shift active array. The proposed active array consists of hundreds to thousands of equal phase-shift elements. Features and simulated performances of the proposed transmitting antenna are presented. Preliminary experimental results from a 2.1 m reflector fed through 332 hollow elements are also shown. Since each beam commonly utilizes all active array elements, power sharing among beams is possible, allowing traffic variation among beams without loss of power efficiency     

Call admission control scheme for real-time services in packet-switched OFDM wireless networks

A call admission control scheme is proposed for real-time services in packet-switched orthogonal frequency division multiplexing （OFDM） wireless cellular networks. The main idea of the proposed scheme is to use maximum acceptance ratio to maintain maximum channel utilization for real-time services according to the desired packet-level and call- level quality-of-service （QoS） requirements. The acceptance ratio is periodically adjusted by using a time discrete Markov chain and Wiener prediction theory according to the varying traffic load. Extensive simulation results show that this algorithm maintains high channel utilization, even as it guarantees packet-level and call-level QoS requirements for real-time services.     

A call admission control scheme for ATM networks using a simplequality estimate

The authors propose a call admission control scheme based on a method of estimating cell loss quality for individual bursty traffic sources. The estimate is expressed in terms of virtual cell loss probability, which may be defined by two traffic characteristic parameters alone: peak and mean rate. The approach is suitable for the estimation of real cell loss probability in heterogeneous and homogeneous traffic models when burst length is larger than buffer capacity. The concept of virtual cell loss probability is extended to the individual call level so as to be able to estimate the quality of service (QOS) provided to individual calls. A virtual bandwidth method is used to develop a practical call admission control system. Quality is ensured by combining a traffic clustering scheme, with a scheme for assigning individual clusters to subcapacities of a link. Priority levels are presented in terms of the class of QOS required, i.e., deterministic or statistical, and the allocation of virtual bandwidth is discussed in terms of both QOS class and traffic characteristics     

综合业务接入ATM网络的资源共享

本文提出了一种在ATM网络中传输综合业务的资源共享方案,该方案中,每一VP只传输一类业务,并根据各业务的带宽,各VP传输的业务量和链路的剩余带宽动态分配各个VP占用的宽带,在保证各类业务呼损率的前提下,可获得提高传输效率和降低节点归一化处理负荷的良好折衷。本文还引入了迟滞和资源预留两个概念,并分析了它们对呼损率和节点的归一化处理负荷的影响,最后给出了详细的理论分析和计算机模拟结果。     

Web services architecture for user control and management of optical Internet networks

One of the primary goals of the CA*net 4 network is to provide end users with the ability, on a peer-to-peer basis, to provision, manage, and control the routing of their own lightpaths across the network without the need to signal or request services from any central network management authority or server. A novel approach to such end-user management and control of lightpaths is described, which uses Web services architecture and grid technology.     

A seamless soft handover management scheme in NGEO satellite networks

Satellite networks can provide extensive geographic coverage to diverse user population, but handovers of active communications should be controlled considering the satellites' high speed. Mobile IP and many other handover algorithms have been proposed for terrestrial wireless networks. However, the satellite network exhibits several unique features compared with the terrestrial wireless networks, such as the long delay. This paper proposes a seamless soft handover scheme (S2H) for satellite networks. S2H designs an identity locator split addressing to solve the multihoming problem and applies the network coding scheme during handover. This manner is able to reduce the interference opportunity, save transmissions, and achieve low handover delay, short queue length, and high throughput. Relying on the simulation results, S2H is able to achieve better performance compared with the proposed handover algorithms in the satellite environment when there are multiple traffic flows. Copyright © 2013 John Wiley & Sons, Ltd.     

On the effects of traffic mixtures in direct broadcast satellite networks

In this paper we present a multi‐criterion control simulation in a realistically complex environment of a satellite network, involving non‐symmetric up and downlinks. Direct broadcast satellite (DBS) networks carrying heterogeneous traffic is characterized with challenges, such as high traffic burstiness, wireless channel dynamics, and large, but limited capacity. On the other hand, there are system characteristics that can be leveraged to address these challenges such as in centralized topology, different levels in quality of service (QoS) and priorities, availability of side information about channel conditions, flexibility in delivery of delay insensitive traffic, etc. We have developed an adaptive resource allocation and management (ARAM) system that takes the advantage of such characteristics to maximize the utilization of the available capacity on the forward DBS link, while maintaining QoS in the presence of channel effects and congestion in the network. Since variable‐bit‐rate (VBR) video traffic is given priority over available‐bit‐rate (ABR) data traffic in the ARAM concept, in this paper we investigate the impact of the fraction of VBR load in overall load. Copyright © 2002 John Wiley & Sons, Ltd.     

无线传感器网络的簇头功率控制技术

在军事侦察与环境监测中,无线传感器网络一般部署在无人区域或危险区域,不能依靠人对系统进行配置与管理.网络节点通过撒播造成分簇后密度不均,影响了网络性能.由于同簇节点通信使用同一信道,簇的大小直接关系到每个节点的通信能力.当簇内节点个数处于一个合适的范围时,网络才能发挥最好的性能.因此需要对簇头进行功率控制来优化网络结构.针对这一缺乏准确数学模型的过程,提出一种基于PID的模糊自适应的变步长簇头功率控制方案,把簇内节点数目控制在一个合理的范围内.其特点是概念简单、易于理解和提高系统的鲁棒性,仿真结果从理论上证明了通过控制分簇大小以后,网络的寿命和通信能力都有所增加.     

Delay-aware reliable broadcast scheme based on power control for VANETs简

In vehicular Ad-hoc network（VANET）, many multi-hop broadcast schemes are employed to widely propagate the warning messages among vehicles and the key is to dynamically determine the optimal relay vehicle for retransmission. In order to achieve reliable and fast delivery of warning messages, this paper proposes a delay-aware and reliable broadcast protocol（DR-BP） based on transmit power control technique. First, a comprehensive model is derived to evaluate the transmission in vehicle-to-vehicle communications. This model considers the wireless channel fading, transmission delay and retransmissions characters occurring in the physical layer/medium access control（PHY/MAC） layer. Then, a local optimal relay selection mechanism based on the above model is designed. In DR-BP scheme, only the vehicle selected as the optimal relays can forward warning messages and the transmit power is time-varying. Finally, extensive simulations verify the performance of DR-BP under different traffic scenarios. Simulation results show that DR-BP outperforms the traditional slotted 1-persistence（S1P） and flooding scheme in terms of packets delivery ratio and transmission delay.     

High altitude platform networks: A feedback suppression algorithm for reliable multicast/broadcast services

High Altitude Platforms (HAP) are currently considered as an alternative solution for providing reliable multicast and broadcast services. The major problem limiting the scalability of such systems is Feedback Implosion, a problem arising whenever a large number of users transmit their feedback messages. In the present Letter, a novel scheme is proposed which takes into account rain attenuation being the dominant factor impairing link performance. The proposed scheme is based on the selection of an Area Representative (AR) which is responsible for providing quick feedback messages to the HAP, thus suppressing feedback messages sent by other users. The proposed scheme is assessed both through analytical modeling and simulation with very satisfactory results.     

Analysis and modelling of broadcast services for TDMA wireless ad hoc networks

MAC protocols designed to provide QoS in wireless ad hoc networks need to be able to reserve and control resources efficiently. To this purpose, TDMA-based networks often lie in a frame subdivision that consists of a broadcast control phase and an information phase. In the control phase, each active terminal broadcasts signalling information required to handle the access to the data resources. Analysis and modelling of the broadcast service is carried out, which allows an efficient frame dimensioning in this scenario     

A simple,scalable and provably stable explicit rate computation scheme for flow control in communication networks

This paper describes fast rate computation (FASTRAC), an explicit rate flow control algorithm for available bit rate (ABR) traffic. Using digital control theory, we develop a simple rate controller for the ABR flow control process. We prove that the controller is stable, fair to all participating sources and configurable with respect to responsiveness. The analysis presented shows that stability of the flow control process depends primarily on two factors, the control update rate and the feedback delay. The implementation of the proposed algorithm is much simpler than other fair rate allocation algorithms. The proposed algorithm demonstrates the ability to scale with speed, distance, different feedback delays, number of users, and number of nodes while remaining robust, efficient, and fair under stressing and dynamic traffic conditions. Copyright © 2001 John Wiley & Sons, Ltd.     

A distributed mobility control scheme in LISP networks

The locator identifier separation protocol (LISP) has been made as an identifier-locator separation scheme for scalable Internet routing. However, the LISP was originally designed for fixed network environment, rather than for mobile network environment. In particular, the existing LISP mobility control schemes use a centralized map server to process all the control traffics, and thus they are intrinsically subject to some limitations in mobile environment, such as large overhead of mapping control traffics at central map server and degradation of handover performance. To overcome these problems, we propose a distributed mobility control scheme in LISP networks. In the proposed scheme, we assume that a mobile host has a hierarchical endpoint identifier which contains the information of its home network domain. Each domain has a distributed map server (DMS) for distributed mapping management of Endpoint Identifiers (EIDs) and Locators (LOCs). For roaming support, each DMS maintains a home EID register and a visiting EID register which are used to keep the EID-LOC mappings for mobile hosts in the distributed manner. For performance analysis, we compare the control traffic overhead (CTO) at map servers, the signaling delay required for EID-LOC mapping management, and the handover delay for the existing and proposed schemes. From numerical results, it is shown that the proposed distributed scheme can give better performance than the existing centralized schemes in terms of CTO, total signaling delay for EID-LOC mapping management, and handover delay.     

Dissemination of routing information in broadcast networks: OSPFversus IS-IS

OSPF and IS-IS are two main standard link state routing protocols designed to operate in various complex network topologies. One aspect that both protocols handle is the reliable dissemination of routing information over broadcast networks such as Ethernet and FDDI. Both protocols suggest different schemes for this purpose and in this article we compare the two. The performance criteria being checked are: the longest arrival time of a routing update packet at all the routers; the average arrival time of routing update packets at all the routers; the total required bandwidth; and the number of memory accesses a router performs, which is evidence of the amount of internal work it performs. We find that in our model of broadcast networks the scheme suggested in IS-IS is more efficient than that of OSPF in terms of the arrival times of routing update packets. In particular, the average arrival time of routing update packets in OSPF is 2-10 times longer than in IS-IS. In terms of the bandwidth each scheme consumes, there are scenarios where OSPF outperforms IS-IS and vice versa. In terms of the number of memory accesses routers perform in each scheme, IS-IS outperforms OSPF     

A novel convex hull-based flooding scheme using 1-hop neighbor information for mobile ad hoc networks

Flooding is one of the most essential and commonly used operations in mobile ad hoc networks. Different sender-based and receiver-based flooding algorithms have been presented separately in the literature. To integrate the advantages of sender-based and receiver-based flooding algorithms, this paper proposes a novel joint 1-hop neighbor information-based flooding scheme that consists of two sub-algorithms: the sender-phase algorithm and the receiver-phase algorithm. The sender-phase algorithm of our flooding scheme helps a node select a subset of its 1-hop neighbors to forward the flooding message. Based on the convex-hull concept, this algorithm selects forwarding nodes with the highest contribution to flooding message dissemination. On the other hand, the receiver-phase algorithm complements the sender-phase algorithm, allowing our flooding scheme to guarantee full delivery. We prove that our flooding scheme requires lower time complexity O(n log h), where h is the number of forwarding nodes, than the best known 1-hop neighbor information-based flooding algorithms proposed by Liu et al. and Khabbazian et al. Additionally, to alleviate the local optimal problem caused by sender-based flooding algorithms, we relax the full delivery requirement and modify our flooding scheme to discard more redundant rebroadcasting operations. Simulation experiments are conducted to compare the performance of our flooding schemes with those of Liu et al.??s and Khabbazian et al.??s flooding algorithms. The simulation results show that our flooding schemes accomplish a lower ratio of broadcasting nodes and a higher message delivery ratio simultaneously under various network conditions. Moreover, since our flooding schemes have lower ratios of broadcasting nodes, they incur fewer packet collisions on the network. Consequently, message disseminations applying our flooding schemes have a smaller effect on other transmissions of different message types.     

Minimum flow maximum residual routing in LEO satellite networks using routing set

Satellite networks are used as backup networks to the terrestrial communication systems. In this work, we tried to find a routing strategy over dynamic satellite systems to better utilize the capacity of the network. The satellite networks are not affected by natural disasters, therefore they can be used widely during and after disasters. The Minimum Flow Maximum Residual (MFMR) routing algorithm over the Routing Set boundaries is proposed in order to better utilize the capacity of the system by distributing the load over the shortest path alternatives of the system. We assumed the satellite network as having finite states and formulated the problem by using Finite State Automation concept along with earth-fixed cell strategy by using a virtual satellite network model. The routing problem in satellite networks is previously studied in the literature and it is conjectured that the problem is NP-Hard. The online and offline problems are stated and the MFMR algorithm is described in detail. The algorithm is compared with alternatives by simulating the network on Opnet Modeler. Finally, the performance analysis of different scenarios is given in this work. Roy Kucukates received his BS, MS and PhD degrees in computer engineering from Bogazici University, Istanbul, in 1993, 1995 and 2002, respectively. He worked as teaching assistant in Bogazici University between 1993 and 1995. Currently, he is a part time instructor in the Computer Engineering Department of Koc University and Dogus University. He is the co-founder and manager of Gordion Bilgi Hizmet Ltd Sti. LEO satellite networks, wireless networks, simulation and performance evaluationl, routing protocols can be stated among his research areas. Cem Ersoy received his BS and MS degrees in electrical engineering from Bogazici University, Istanbul, in 1984 and 1986, respectively. He worked as an R&D engineer in NETAS A.S. between 1984 and 1986. He received his PhD in electrical engineering from Polytechnic University, Brooklyn, New York in 1992. Currently, he is a professor and department head in the Computer Engineering Department of Bogazici University. His research interests include performance evaluation and topological design of communication networks, wireless communications and mobile applications. Wireless sensor networks. Dr. Ersoy is a Senior Member of IEEE.