2,599 research outputs found

    Survey of Inter-satellite Communication for Small Satellite Systems: Physical Layer to Network Layer View

    Get PDF
    Small satellite systems enable whole new class of missions for navigation, communications, remote sensing and scientific research for both civilian and military purposes. As individual spacecraft are limited by the size, mass and power constraints, mass-produced small satellites in large constellations or clusters could be useful in many science missions such as gravity mapping, tracking of forest fires, finding water resources, etc. Constellation of satellites provide improved spatial and temporal resolution of the target. Small satellite constellations contribute innovative applications by replacing a single asset with several very capable spacecraft which opens the door to new applications. With increasing levels of autonomy, there will be a need for remote communication networks to enable communication between spacecraft. These space based networks will need to configure and maintain dynamic routes, manage intermediate nodes, and reconfigure themselves to achieve mission objectives. Hence, inter-satellite communication is a key aspect when satellites fly in formation. In this paper, we present the various researches being conducted in the small satellite community for implementing inter-satellite communications based on the Open System Interconnection (OSI) model. This paper also reviews the various design parameters applicable to the first three layers of the OSI model, i.e., physical, data link and network layer. Based on the survey, we also present a comprehensive list of design parameters useful for achieving inter-satellite communications for multiple small satellite missions. Specific topics include proposed solutions for some of the challenges faced by small satellite systems, enabling operations using a network of small satellites, and some examples of small satellite missions involving formation flying aspects.Comment: 51 pages, 21 Figures, 11 Tables, accepted in IEEE Communications Surveys and Tutorial

    State-Dependent Bandwidth Sharing Policies for Wireless Multirate Loss Networks

    Get PDF
    We consider a reference cell of fixed capacity in a wireless cellular network while concentrating on next-generation network architectures. The cell accommodates new and handover calls from different service-classes. Arriving calls follow a random or quasi-random process and compete for service in the cell under two bandwidth sharing policies: 1) a probabilistic threshold (PrTH) policy or 2) the multiple fractional channel reservation (MFCR) policy. In the PrTH policy, if the number of in-service calls (new or handover) of a service-class exceeds a threshold (difference between new and handover calls), then an arriving call of the same service-class is accepted in the cell with a predefined state-dependent probability. In the MFCR policy, a real number of channels is reserved to benefit calls of certain service-classes; thus, a service priority is introduced. The cell is modeled as a multirate loss system. Under the PrTH policy, call-level performance measures are determined via accurate convolution algorithms, while under the MFCR policy, via approximate but efficient models. Furthermore, we discuss the applicability of the proposed models in 4G/5G networks. The accuracy of the proposed models is verified through simulation. Comparison against other models reveals the necessity of the new models and policies

    Goodbye, ALOHA!

    Get PDF
    ©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft

    Mobile agent based distributed network management : modeling, methodologies and applications

    Get PDF
    The explosive growth of the Internet and the continued dramatic increase for all wireless services are fueling the demand for increased capacity, data rates, support of multimedia services, and support for different Quality of Services (QoS) requirements for different classes of services. Furthermore future communication networks will be strongly characterized by heterogeneity. In order to meet the objectives of instant adaptability to the users\u27 requirements and of interoperability and seamless operation within the heterogeneous networking environments, flexibility in terms of network and resource management will be a key design issue. The new emerging technology of mobile agent (MA) has arisen in the distributed programming field as a potential flexible way of managing resources of a distributed system, and is a challenging opportunity for delivering more flexible services and dealing with network programmability. This dissertation mainly focuses on: a) the design of models that provide a generic framework for the evaluation and analysis of the performance and tradeoffs of the mobile agent management paradigm; b) the development of MA based resource and network management applications. First, in order to demonstrate the use and benefits of the mobile agent based management paradigm in the network and resource management process, a commercial application of a multioperator network is introduced, and the use of agents to provide the underlying framework and structure for its implementation and deployment is investigated. Then, a general analytical model and framework for the evaluation of various network management paradigms is introduced and discussed. It is also illustrated how the developed analytical framework can be used to quantitatively evaluate the performances and tradeoffs in the various computing paradigms. Furthermore, the design tradeoffs for choosing the MA based management paradigm to develop a flexible resource management scheme in wireless networks is discussed and evaluated. The integration of an advanced bandwidth reservation mechanism with a bandwidth reconfiguration based call admission control strategy is also proposed. A framework based on the technology of mobile agents, is introduced for the efficient implementation of the proposed integrated resource and QoS management, while the achievable performance of the overall proposed management scheme is evaluated via modeling and simulation. Finally the use of a distributed cooperative scheme among the mobile agents that can be applied in the future wireless networks is proposed and demonstrated, to improve the energy consumption for the routine management processes of mobile terminals, by adopting the peer-to-peer communication concept of wireless ad-hoc networks. The performance evaluation process and the corresponding numerical results demonstrate the significant system energy savings, while several design issues and tradeoffs of the proposed scheme, such as the fairness of the mobile agents involved in the management activity, are discussed and evaluated

    An analytical framework in LEO mobile satellite systems servicing batched Poisson traffic

    Get PDF
    The authors consider a low earth orbit (LEO) mobile satellite system (MSS) that accepts new and handover calls of multirate service-classes. New calls arrive in the system as batches, following the batched Poisson process. A batch has a generally distributed number of calls. Each call is treated separately from the others and its acceptance is decided according to the availability of the requested number of channels. Handover calls follow also a batched Poisson process. All calls compete for the available channels under the complete sharing policy. By considering the LEO-MSS as a multirate loss system with ‘satellite-fixed’ cells, it can be analysed via a multi-dimensional Markov chain, which yields to a product form solution (PFS) for the steady-state distribution. Based on the PFS, they propose a recursive and yet efficient formula for the determination of the channel occupancy distribution, and consequently, for the calculation of various performance measures including call blocking and handover failure probabilities. The latter are much higher compared to the corresponding probabilities in the case of the classical (and less bursty) Poisson process. Simulation results verify the accuracy of the proposed formulas. Furthermore, they discuss the applicability of the proposed model in software-defined LEO-MSS

    A survey of machine learning techniques applied to self organizing cellular networks

    Get PDF
    In this paper, a survey of the literature of the past fifteen years involving Machine Learning (ML) algorithms applied to self organizing cellular networks is performed. In order for future networks to overcome the current limitations and address the issues of current cellular systems, it is clear that more intelligence needs to be deployed, so that a fully autonomous and flexible network can be enabled. This paper focuses on the learning perspective of Self Organizing Networks (SON) solutions and provides, not only an overview of the most common ML techniques encountered in cellular networks, but also manages to classify each paper in terms of its learning solution, while also giving some examples. The authors also classify each paper in terms of its self-organizing use-case and discuss how each proposed solution performed. In addition, a comparison between the most commonly found ML algorithms in terms of certain SON metrics is performed and general guidelines on when to choose each ML algorithm for each SON function are proposed. Lastly, this work also provides future research directions and new paradigms that the use of more robust and intelligent algorithms, together with data gathered by operators, can bring to the cellular networks domain and fully enable the concept of SON in the near future

    Satellite Communications

    Get PDF
    This study is motivated by the need to give the reader a broad view of the developments, key concepts, and technologies related to information society evolution, with a focus on the wireless communications and geoinformation technologies and their role in the environment. Giving perspective, it aims at assisting people active in the industry, the public sector, and Earth science fields as well, by providing a base for their continued work and thinking
    • 

    corecore