Internet of Things, Smart Spaces, and Next Generation Networking

Every day, our world is getting more instrumented and interconnected. Streams of data are continuously being generated by mobile devices, personal computers, networks, sensors, RFID tags, web services, social media and the like. IBM’s newest study reveals how new technologies support the development of the Internet of Things, and how the Internet of Things provides the foundational infrastructure for a smarter planet. Key trends that relate to the Internet of Things include Mobile, Big Data, Cloud Computing, and Smart Networks. The paper describes the latest developments in Mobile, Big Data (including cognitive systems capable to evaluate large amounts of both structured and unstructured data), Cloud Computing and Smarter networks (including software defined environments to cope with the ever increasing workloads in the networks).

This article describes the work on validation and measurement while dealing with integration of heterogeneous IoT systems being done within BUTLER research project. First, we give the brief motivation for integration work and reference the visionary Smart Life scenario of hypothetic personas’ day from the year 2020. Presentation of identified security and privacy concerns of IoT deployments follows Smart Life scenario because of inevitable direct impact on large number of human end-users. Development objectives towards integration of heterogeneous IoT systems follow the defined scenario and are accompanied by IoT technical feasibility and user feedback validation targets and measurement values for the four to-be-deployed IoT applications. The architectural system overview of technological enablers of interoperability and interconnection between and within IoT applications are also important parts of the on-going research. The IoT application example gives an understanding on applicability of previously described considerations particularly in Smart Home domain. We round off with discussion on our developments at the end.

Next generation sensor networks are predicted to be deployed in the

Internet-of-the-Things (IoT)

with a high level of heterogeneity. They will be using sensor motes which are equipped with different sensing and communication devices and tasked to deliver different services leading to different energy consumption patterns. The application of traditional wireless sensor routing algorithms designed for sensor motes expanding the same energy to such heterogeneous networks may lead to energy unbalance and subsequent short-lived sensor networks resulting from routing the sensor readings over the most overworked sensor nodes while leaving the least used nodes idle. Building upon node interference awareness and sensor devices service identification, we assess the relevance of using a routing protocol that combines these two key features to achieve efficient traffic engineering in IoT settings and its relative efficiency compared to traditional sensor routing. Performance evaluation with simulation reveals clear improvement of the proposed protocol vs. state of the art solutions in terms of load balancing, notably for critical nodes that cover more services. Results show that the proposed protocol considerably reduce the number of packets routed by critical nodes, where the difference with the compared protocol becomes more and more important as the number of nodes increases. Results also reveal clear reduction in the average energy consumption.

The Internet of Things (IoT) vision foresees a future Internet encompassing the realm of smart physical objects, which offer hosted functionality as services. The role of service discovery is crucial when providing application-level, end-to-end integration. In this paper, we propose

trendy

: a RESTful web services based Service Discovery protocol to tackle the challenges posed by constrained domains while offering the required interoperability. It provides a service selection technique to offer the appropriate service to the user application depending on the available context information of user and services. Furthermore, it employs a demand-based adaptive timer and caching mechanism to reduce the communication overhead and to decrease the service invocation delay.

trendy

’s grouping technique creates location-based teams of nodes to offer service composition. Our simulation results show that the employed techniques reduce the control packet overhead, service invocation delay and energy consumption. In addition, the grouping technique provides the foundation for group-based service mash-ups and localises control traffic to improve scalability.

The smart spaces paradigm and the M3 concept have already showed their potential for constructing advanced service infrastructures. The Internet of Things (IoT) provides the possibility to make any “thing” a user or component of such a service infrastructure. In this paper, we consider the crucial design challenges that smart spaces meet for deploying in IoT: (1) interoperability, (2) information processing, (3) security and privacy. The paper makes a step toward a systematized view on smart spaces as a computing paradigm for IoT applications. We summarize the groundwork from pilot M3 implementations and discuss solutions to cope with the challenges. The considered solutions can be already used in advanced service infrastructures.

The paper continues the study of dataflow networks based on top of Smart-M3 platform. The goal is to provide support for implementation of reliable ubiquitous services based on the dataflow model. We propose agent substitution as a way to make services robust and describe behaviour and implementation aspects of the agent substitution mechanism in semantic information broker. The mechanism allows to safely transfer computational context from one agent to another preventing long service downtime when an agent unanticipatedly disconnects from the network. The potential benefit of using such a mechanism is discussed for the medical telemonitoring service.

In this paper, we propose a framework enabling physical objects used everyday to participate in smart interactions. These objects are RFID tagged containing self description of their properties. The paper describes how smart context aware services can be supported directly by a collection of smart objects. One of the main advantage of our approach is the smart objects being piggybacked with necessary information, optimized enough to make inferences locally, without dependence on external system support.

Nowadays, the variety of mobile services is growing together with the number of customers and the heterogeneity of their mobile devices, thus, monitoring the users of a mobile network has become a challenge. Considering

Smart Space Governing

to address this issue, in which the mobile network is considered an Smart Space (due to its size and complexity) and their elements (mobile devices and network monitoring services), it is possible to create rules to monitor the output of these elements. We call those rules as

Smart Space Compositions

and can be created through the platform’s

Visual Editor

, that during the graphical creation process, provides the user with a list of similar existing compositions that can be reused at any time to improve the composition process. This paper describes the implementation by a Telecommunications Operator of this composition module supported by subgraph isomorphism techniques.

Nowadays there is a wide range of different mobile solutions that support travelers before, during and after the trip. However, majority of these solutions focus either on recommending tourist attractions or on providing of some tourist services, but there is a lack of studies for unified approach that combines both needs. This paper describes mobile tourist guide - a complex system that enables comprehensive up-to date information search along with personalized recommendations and services. The key principle of the developed solution is based on fact that to provide really relevant tourists information, it should be based on analysis of current situation. Prototype of the mobile tourist guide has been developed using Smart Space infrastructure to facilitate integration of services and internal processes in such complex system. This paper aims to describe context-based information implementation in the complex mobile tourist guide, developed using Smart Space infrastructure.

Geo-tagging and smart spaces are two promising directions in modern mobile market. Geo-tagging allows to markup any kind of data by geographical coordinates and time. This is the basis for defining geographical context which can be used in different types of applications e.g. semantic information search, machine-to-machine (M2M) interactions. Smart spaces as the basis for seamless distributed communication field for software services provides semantic level for data processing. Most desired feature of coming software is pro-activeness and context awareness, i.e. services will be able to adapt to the user’s needs and situations and be able to manage decisions and behaviors on behalf of the user. The paper is dedicated discussion of integration most popular open platforms for smart spaces and geo-tagging (Smart-M3 and Geo2Tag) as possible solution for creation context aware proactive location based (LBS) services.

Many of modern location-based services are often based on an area or place as opposed to an accurate determination of the precise location. Geofencing approach is based on the observation that users move from one place to another and then stay at that place for a while. These places can be, for example, commercial properties, homes, office centers and so on. As per geofencing approach they could be described (defined) as some geographic areas bounded by polygons. It assumes users simply move from fence to fence and stay inside fences for a while. In this article we replace geo-based boundaries with network proximity rules. This new approach let us effectively deploy indoor location based services and provide a significant energy saving for mobile devices comparing with the traditional methods.

Ambient-assisted living (AAL) is an initiative to extend the time the elderly can live in their home environment by increasing their autonomy and assisting them carry out their daily activities. AAL systems exploit information and communication technologies (ICT) in the assistance to carry out daily activities, health and activity monitoring, enhancing safety and security and getting access to social, medical and emergency systems. These ICTs are in the form of smart systems, which are physical objects that are augmented with sensing, processing and network capabilities, enabling them not only to intercommunicate with one another, but also to exchange information with people and react to their environment. This paper is on a low-cost technology customised to the South African environment to support ambient assisted living. The technology takes advantage of South Africa’s digitalisation programme to provide broadband access in the support of AAL. Digital television as a gateway to internet access, wireless mesh networks for communication, motes for machine to machine communication and smart phones are the technologies supported in this architecture. A survey of AAL technologies was conducted and features of these systems that would be useful in defining our architecture identified. These features contribute to the development of an architecture for AAL. This research feeds into extending the body of knowledge on AAL technologies.

This paper describes an algorithm for discovery of convoys in database with proximity log. Traditionally, discovery of convoys covers trajectories databases. This paper presents a model for context-aware browsing application based on the network proximity. Our model uses mobile phone as proximity sensor and proximity data replaces location information. As per our concept, any existing or even especially created wireless network node could be used as presence sensor that can discover access to some dynamic or usergenerated content. Content revelation in this model depends on rules based on the proximity. Discovery of convoys in historical user’s logs provides a new class of rules for delivering local content to mobile subscribers.

Multiple-input multiple-output (MIMO) systems using spatial division multiplexing (SDM) technique have been considered a potential technology for high speed data transmission wireless internet networks, such as IEEE 802.11, 3GPP Long Term Evolution, WiMAX. Many studies have confirmed that the channel capacity is significantly increased and proportional to the number of transmit and receive antennas without additional power and spectrum compared with single-input single-output systems. Although a lot of technical papers have been considered and evaluated the MIMO SDM systems based on theory analyses and/or computer simulation, but just few ones investigated the systems based on hardware design, which is an important step before going to manufacture the integrated circuits. In the paper, we present our own design and implementation of three MIMO SDM systems on FPGA-based DSP Development Kit. Based on the design, we evaluate the bit-error rate performance of the systems and also consider the consumption of the FPGA elements in our design.

An ever growing number of deployed wireless networks dictates a tempo with which the inter-network cooperation techniques are being developed. Cooperation, in this sense, can go far beyond a simple activation of an interference avoidance techniques. This paper describes and evaluates the performance of a reinforcement learning based reasoning engine, used in a self-learning, cognitively controlled cooperation between heterogeneous, co-located networks. Coupled with a concept of cooperation through the network service negotiation, this approach represents an efficient, yet scalable solution for the dynamic network self-optimization.

Future wireless systems will need to cope with highly dispersive channels in order to support high data rates. A slotted Prefix-assisted DS-CDMA allows the multiplexing of various Mobile Terminals (MTs) at the uplink with appropriate Frequency Domain Equalization (FDE) to support the dispersive channels. However data packets can be received with errors due to channel interference or from a deep fade that persists for several slots; to cope with those errors a type II Hybrid Automatic Repeat reQuest (H-ARQ) protocol could be employed to re-use the signals from past packet copies to diminish errors. Most wireless CDMA models that employ H-ARQ assume a simplified characterization of the wireless channel, based on an average Signal to Interference-Noise Ratio (SINR), with simultaneous data transmissions from the MTs to a Base Station (BS). This paper proposes a DS-CDMA model that accounts the MTs’ channel interference and channel noise simultaneously; packet reception is possible with the aid of a linear equalization method previously published by the authors. The wireless MAC model is characterized with Discrete-Time Markov Chain (DTMC), where the delay and throughput are obtained for a

Poisson

packet generator. The performance of the wireless model shows accurate results against the simulation values.

We consider the data delivery problem in delay tolerant networks, where a data content is located in a fixed source need to be delivered to a specific destination. We assume nodes have limited storage and computational capabilities. In this paper, we initially, explore the data delivery problem, for both unbiased and biased contact models. Based on our observations, we propose a data delivery scheme that can reduce both storage overhead and delivery delay. Our scheme combines erasure coding technique and the framework of simulated annealing optimization, in order to maximize the content delivery probability to the destination.

At this moment consumers want an internet connection with 20-50 Mb/s speed and around 100 Mb/s in the near future. Rolling out Fibre to the Curb networks quickly will be the only way for telecom operators in some countries to compete with cable tv operators. This requires a fibre connection to the cabinets. When the telecom operator wants to connect the cabinets in a ring structure, he has to decide how to divide cabinets over a number of circuits, taking into account a maximum number of customers per circuit. This we call the cabinet clustering problem. In this paper we formulate this problem, present the heuristic approch we developed and show the results of our extensive testing that shows the method is accurate and fast. Finally we demonstrate the method on a real life case.

A prospective next generation wireless network is expected to integrate harmoniously into an IP-based core network. It is widely anticipated that IP-layer handover is a feasible solution to global mobility. However, the performance of IP-layer handover based on basic Mobile IP (MIP) cannot support real time services very well due to long handover delay. The Internet Engineering Task Force (IETF) Network-based Localized Mobility Management (NETLMM) working group developed a network-based localized mobility management protocol called Proxy Mobile IPv6 (PMIPv6) to reduce the handoff latency of MIPv6. Moreover, PMIPv6 provides the IP with the mobility to support User Equipments (UEs) without it being required to participate in any mobility-related signaling. This was one of the reasons why the 3rd Generation Partnership Project (3GPP) chose PMIPv6 as one of the mobility management protocols when defining the Evolved Packed System (EPS). One of the key features of the standard is its support for access system selection based on a combination of operator policies, user preference and access network conditions. Although Android, which is one of the most popular “mobile” operating system, is not officially supporting IPv6 nor PMIPv6, this paper analyzes the required challenges for IPv6 and PMIPv6 usage and handover performance with real-time services. The analysis and measurement results show that, with the modifications presented IPv6 and PMIPv6 may be supported and utilized for localized mobility management and seamless handovers. ...

Data packets from different TCP (Transmission Control Protocol) flows, which are transferred over IP (Internet Protocol) networks, pass through the various links and through the different capacity router buffers on the way to the receivers. Most authors consider the size of the output buffer on the router that is connected to the rest of the network via bottleneck link, equal to bandwidth-delay product. In more recent studies, based on the assumption that TCP flows are desynchronized, much lower values are suggested. In this paper we analyse wireless last hop links with errors occurring during signal transmission. Established TCP flows are considered both synchronized and desynchronized. Also, reverse traffic is present. Simulations are made with different number of flows originating from different protocols. The obtained results show that proposed buffer size values do not correspond to the optimal ones. That is why we determine the optimal buffer sizes.

Problem of the monitoring of the network performance is important task for different classes of network applications and services. In this paper the system for monitoring of network connections at transport layer is presented. In contrast to existing analogs the monitor is able to provide details on network stack operation visible only at Linux kernel level since the monitor presented operates in both kernel and user space. The paper describes high level architecture of the system, important features of the implementation and testing results.

Small-cell, open capacity sharing scenarios in Cognitive Radio (CR) environments are studied from a game theoretical (GT) perspective. Simultaneous capacity requests in small-cell scenarios are modelelled as strategic interactions between CRs and analysed as resource access games. CR capacity access competition is modelled based on discrete reformulations of the Bertrand GT model. Detected equilibria describe stable game situations. Numerical simulations identify situations where Nash equilibrium (NE) is both fair and Pareto efficient or where there are multiple NE solutions to choose from, indicating a flexible range for CR strategies. Adding to the analysis are the joint Nash-Pareto solutions (intermediate between Nash and Pareto) capturing heterogeneous behaviour of players. Stable and equitable states are detected even when players have different biases.

The medium access control (MAC) of decentralized cognitive radio networks has been a topic of interest in the last years due to the lack of a central coordinator and the necessity of self-organizing procedures that effectively lead the nodes to act autonomously but efficiently. This work addresses a scenario where multiple non-licensed cognitive radios communicate with an access point when licensed users do not use the spectrum. We consider a MAC protocol for the non-licensed users which uses a double stage to schedule each node’s transmission. Non-licensed users perform spectrum sensing in a synchronous way and the proposed MAC is opportunistically employed when the channel is sensed idle. In the first stage the number of competing non-licensed nodes is decreased to reduce the number of collisions. In the second stage we adopt a reservation procedure to schedule the non-licensed users competing for the medium. Adopting a traditional energy-based sensing, we characterize the performance of the considered protocol by capturing the influence of the sensing in the MAC’s performance. Finally we present several results to evaluate the performance of the proposed scheme achieved in optimal conditions, which are compared to a cognitive ”slotted-aloha”-like protocol. The obtained results demonstrate the effectiveness of the proposed solution.

In this paper, we propose a model for coalition formation among Secondary Users (SUs) with incomplete information in Cognitive Radio (CR) networks based on the Bayesian equilibrium. This model allows us to study coalition formation among SUs with respect to the stations’ information endowments. By using the proposed method, SUs can self-organize into disjoint independent coalitions. We are the able identify the cost of incomplete information on the Bayesian equilibrium. As a result, we can propose an algorithm for coalition formation among SBSs with incomplete information based on the Bayesian equilibrium. To evaluate our approach, we developed a realistic model of cognitive radio networks, and used them to make simulation experiments. The results demonstrate the practicality of our algorithm.

In this paper a secure wireless sensor network (WSN) developed within the MOVEDETECT project is presented. The goal of the project was to design, implement and demonstrate a secure WSN for the protection of critical infrastructure. In order to provide a reliable service, the system must detect any kind of tampering with the sensor nodes, prevent eavesdropping and manipulation of the communication as well as detect, track and classify intruders in the protected region. Therefore based on previous experiences, a real-world WSN was developed, which addresses practical issues like water proofing, energy consumption, sensor deployment and visualization of the WSN state, but also provides a unique security concept, a interesting combination of sensors and sophisticated sensor data processing and analysis. The system was evaluated by examining firstly the sensors and the sensor processing algorithms and then conducting realistic field test.

The application of Wireless Sensor Networks (WSNs) is hindered by the limited energy budget available for the member nodes. Energy aware solutions have been proposed for all tasks involved in WSNs, such as processing, routing, cluster formation and communication. With communication being responsible for a large part of the energetic demand of WSNs energy efficient communication is paramount. The application of MIMO (Multiple-Input Multiple-Output) techniques in WSNs emerges as a efficient alternative for long range communications, however, MIMO communication require precise synchronization in order to achieve good performance. In this paper the problem of transmission synchronization for WSNs employing Cooperative MIMO is studied, the main problems and limitations are highlighted and a synchronization method is proposed.

The network-based security defined by International Telecommunication Union (ITU) has specific features for Ubiquitous Sensor Networks (USN). An enormous number of sensor nodes and hard energy constraints define specific network-based security features of USNs. The network-based security features of USNs are considered based on ITU-T Recommendation X.1311. A new type of attacks on the energy system of a USN is proposed, which is based on the spurious flows generation. The sensor nodes respond to the spurious flows and the sensor network life-time decreases. The mobile sensor network behavior in case of spurious flows intrusion is investigated in the paper. A homogenous mobile sensor network and the LEACH-M cluster head selection algorithm are used in this study. The effect of Poisson and deterministic spurious flows intrusion is investigated. The sensor node moving speed influence on the sensor network life-time is analyzed too.

This paper elaborated on the importance of nodes degree and clustering for the efficient operation of Backbone Wireless Mesh Networks (BWMNs). A novel Zero-Degree (S) algorithm proposed for clustering the BWMN based on Wireless Mesh Routers (WMRs) degree/number of WMRs’ connections, while ensuring Delay, Relay load and Cluster size constraints. It is shown that the performance of our algorithm outperforms the other alternatives. It places less Internet GateWays (IGWs), and exhibits smooth and consistent performance when subject to various Quality of Service (QoS) constraints.

As network traffic is dramatically increasing, classification of application traffic becomes important for the effective use of network resources. Classification of network traffic using port-based or payload-based analysis is becoming increasingly difficult because of many peer-to-peer (P2P) applications using dynamic port numbers, masquerading techniques, and encryption. An alternative approach is to classify traffic by exploiting the distinctive characteristics of applications. In this paper, we propose a classification method of application traffic using statistic signatures based on SVM (Support Vector Machine). The statistic signatures, defined as a directional sequence of packet size in a flow, are collected for each application, and applications are classified by SVM mechanism.

RPL is IPv6 Routing Protocol designed for Low Power and Lossy networks. RPL is a distance vector routing protocol that builds Directed Acyclic Graphs (DAGs), using implementation specific routing metrics and constraints. In the construction process of network topology, each node selects a set of potential parents towards the destination and associates itself to a preferred parent, basing on the outcome of Objective Function (OF). OF defines how one or more node and link metrics and constraints are used to compute the node rank.

The purpose of this paper is to analyse, how selection of Objective Function influences network topology. The absence of published papers concerning RPL Objective Function motivates author to focus on this topic. In addition, performance evaluation of network transmission when constructed using different OF is presented. Results where obtained using simulation environment prepared for this and further planned studies on RPL.

The most prominent IT trend nowadays is connection of Wireless Sensor Networks (WSNs) with Internet service infrastructure. Interconnection of the millions of sensor and processing devices will create a tremendous traffic increase that can lead to congestion. In parallel to the development of new protocols for WSNs, e.g., Constrained Application Protocol (CoAP) there is plenty of research for new congestion control techniques (CC). This research shall carefully take into account all key restrictions of sensor networks, e.g., memory and power consumption, lousy paths and limited links throughput. This paper analyzes classical approach of definition of the retransmission timeout (RTO) estimate, proposed in RFC 6298, and compares it with the Eifel Retransmission Timer and the new ideas proposed in CoCoAP. Finally, we present our method for calculating RTO. Our approach could be seen as an extension of the classical TCP algorithm, where instead of constants that are used to take into account history of the current state we use a dynamically changing parameter. The value of this parameter is defined as a ratio between current sample of the round-trip time (RTT) and the RTO value.

Nowadays peer-to-peer (P2P) overlay networks are widespread due to their numerous advantages. In P2P streaming networks the main measures to estimate the video playback quality are playback continuity and startup latency. Most analytical models suggest approximate formulas for playback quality measures or algorithms for different chunk download strategies. In this paper, we develop the discrete Markov chain model of the data exchange process between users in P2P streaming network with buffering mechanism. Unlike most of the existing models, we get the exact formulas to calculate the transition probability matrix for the discrete Markov chain. That let us develop a numerical method for the evaluation of playback continuity in P2P streaming network.

Nowadays HTTP servers and applications are some of the most popular targets for network attacks. In this research, we consider an algorithm for HTTP intrusions detection based on simple clustering algorithms and advanced processing of HTTP requests which allows the analysis of all queries at once and does not separate them by resource. The method proposed allows detection of HTTP intrusions in case of continuously updated web-applications and does not require a set of HTTP requests free of attacks to build the normal user behaviour model. The algorithm is tested using logs acquired from a large real-life web service and, as a result, all attacks from these logs are detected, while the number of false alarms remains zero.

In this paper, we develop a mathematical model of a load control mechanism for SIP server signaling networks based on a hysteretic technique. We investigate loss-based overload control, as proposed in recent IETF documents. The queuing model takes into account three types of system state – normal load, overload, and discard. The hysteretic control is made possible by introducing two thresholds,

L

and

H

, in the buffer of total size

R

. We denote the mathematical model using the modified Kendall notation as an

$MMPP|M|1|\left\langle L,H\right\rangle |R$

queue with hysteretic load control and bursty input flow. Algorithms for computation the key performance parameters of the system were obtained. A numerical example illustrating the control mechanism that minimizes the return time from overloading states satisfying the throttling and mean control cycle time constraints is also presented.

If an accident vehicle propagates emergency messages to other vehicles close to it, the other drivers may realize and avoid the accident spot. In this letter, we propose a broadcast scheme to propagate emergency messages fast in urban VANETs (Vehicular Ad-Hoc Networks) with the help of GPS (Global Position System). In our scheme, a transmitting vehicle chooses the farthest node as the next relay vehicle to propagate emergency messages. And, we suggest an algorithm for intersection recognition and SCF (Store-Carry-Forward) task by taking advantage of periodic hello packets to reduce the propagation time and enhance the delivery ratio.

We propose a cross layer approach to achieve greater routing performance for applications with real time constraints in Mobile Ad Hoc Networks. Interactions between MAC, Network and Application layers are fully exploited to get accurate information about the end-to-end path quality, and the applications’ characteristics. The improvements provided by our scheme come from considering a service class differentiation, a balanced routing protocol and a path quality cost function as well. It aims to enhance the routing performance for real time applications to meet the QoS requirements defined by the ITU-G1010 recommendation. The simulation results and analysis show that our contribution achieves a good performance and capacity gain.

One of the main problems in LTE networks is the distribution of a limited number of radio resources among Human-to-Human (H2H) users as well as the increasing number of machine-type-communication (MTC) devices in machine-to-machine (M2M) communications. Different traffic types from user’s equipment and MTC devices transmitted over the network suggests a dynamic resource allocation in order to provide a better quality of service (QoS). In this paper, we propose a dynamic resource allocation scheme for M2M traffic in LTE networks. The suggested method is based on fixed bandwidth intervals at which traffic from MTC devices is serviced according to the Processor Sharing (PS) discipline. By means of a Markov model, an estimation of the behaviour of LTE for H2H and M2M traffics characteristics is shown. We propose an analytical solution to calculate the model performance measures, such as blocking probabilities for H2H users.

Random Access (RA) approaches in satellite networks may limit the achievable energy efficiency due to the random nature of channel access, especially when hand-held terminals must operate with a very low signal-to-noise ratio. This paper shows that Network Diversity Multiple Access (NDMA) principles can be used to provide an energy efficient RA scheme which satisfies some Quality of Service requirements. The paper proposes performance models for the throughput and energy efficiency considering a finite queue at each terminal and multiple packet retransmissions. Optimal parameters are calculated to maximize the energy efficiency while satisfying the throughput and error requirements, taking into account the bit-rate constraint. The proposed system’s performance is evaluated for a Single-Carrier with Frequency Domain Equalization (SC-FDE) scheme at the uplink. Results show that the proposed system is energy efficient and can provide sustained bandwidth.