the focus of this paper is targeted towards multi-cell dense LTE and LTE-Advanced networks, which are composed of multiple evolved Node B (eNodeB) co-existing in the same operating area and sharing the available radio...
详细信息
ISBN:
(纸本)9781467377010
the focus of this paper is targeted towards multi-cell dense LTE and LTE-Advanced networks, which are composed of multiple evolved Node B (eNodeB) co-existing in the same operating area and sharing the available radio resources. In such scenarios, momentous emphasis is given towards the techniques that take Inter-Cell Interference (ICI) into account while allocating the scarce radio resources. In this context, we propose solutions for the problem of joint power control and scheduling in the framework of Inter-Cell Interference Coordination (ICIC) in the downlink of LTE OFDMA-based multi-cell systems. Two approaches are adopted to allocate system resources in order to achieve high performance: a centralized approach based on convex optimization and a semi-distributed approach based on non-cooperative game theory. the centralized approach needs a central controller to optimally allocate resources like in LTE CoMP (Coordinated Multipoint). In the semi-distributed approach, eNodeBs coordinate among each other for efficient resource allocation based on local knowledge conveyed by the X2 interface. It turns out that despite the lower complexity of the semi-distributed approach and its inherent adaptability, there is only a slight discrepancy of results among both approaches, which makes the distributed approach much more promising, in particular as a procedure of SON (Self Organized Network).
In this paper, we introduce a distributed algorithm for single source shortest path problem for undirected graphs. In this problem, we find the shortest path from a given source node to other nodes in the graph. We st...
详细信息
ISBN:
(纸本)9781479931064
In this paper, we introduce a distributed algorithm for single source shortest path problem for undirected graphs. In this problem, we find the shortest path from a given source node to other nodes in the graph. We start with undirected unweighted graphs in which the shortest path is a path with minimum number of edges. Following, we modify the algorithm to find shortest path for weighted graphs in which the shortest path is a path with minimum cost, i.e., sum of the edge weights. We examine the convergence time of the given algorithm for random Erdos-Renyi graphs as a random variable;based on that we approximate the stop-time criteria of the algorithm for graphs with unknown topology. We claim that the stop-time criteria is related to the graph parameters such as number of nodes and graph diameter.
Stix is a platform managing emerging large-scale broadband wireless access (BWA) networks. It has been developed to make it easy to manage such networks for community deployments and wireless Internet service provider...
详细信息
ISBN:
(纸本)9781450301824
Stix is a platform managing emerging large-scale broadband wireless access (BWA) networks. It has been developed to make it easy to manage such networks for community deployments and wireless Internet service providers while keeping the network management infrastructure scalable and flexible. Stix is based on the notions of goal-oriented and in-network management. With Stix, administrators graphically specify network management activities as workflows, which are deployed at a distributed set of agents within the network that cooperate in executing those workflows and storing management information. We implement the Stix system on embedded boards and show that the implementation has a low memory footprint. Using real topology and logging data from a large-scale BWA network operator, we show that Stix is significantly more scalable (via reduction in management traffic) compared to the commonly employed centralized management approach. Finally we use two case studies to demonstrate the ease with which Stix platform can be used for carrying out network reconfiguration and performance management tasks, thereby also showing its potential as a flexible platform to realize self-management mechanisms.
this paper presents a novel authentication strategy for Bluetooth-equipped smartwatches. We use the built-in smartwatch sensors to detect whether two users have shaken hands. If this is the case each devices give to t...
详细信息
ISBN:
(纸本)9781467377010
this paper presents a novel authentication strategy for Bluetooth-equipped smartwatches. We use the built-in smartwatch sensors to detect whether two users have shaken hands. If this is the case each devices give to the other a soft authentication privilege, which is suitable for applications with relaxed security needs (for instance, an application to exchange business cards). We evaluate the system using different machine learning techniques and we investigate their performance in the dimensions of accuracy and energy consumption.
Mobile devices face a diverse and dynamic set of networking options. Using those options to the fullest requires knowledge of application intent. this paper describes Intentional networking, a simple but powerful mech...
详细信息
ISBN:
(纸本)9781450301824
Mobile devices face a diverse and dynamic set of networking options. Using those options to the fullest requires knowledge of application intent. this paper describes Intentional networking, a simple but powerful mechanism for handling network diversity. Applications supply a declarative label for network transmissions, and the system matches transmissions to the most appropriate network. the system may also defer and re-order opportunistic transmissions subject to application-supplied mutual exclusion and ordering constraints. We have modified three applications to use Intentional networking: BlueFS, a distributed file system for pervasive computing, Mozilla's thunderbird e-mail client, and a vehicular participatory sensing application. We evaluated the performance of these applications using measurements obtained by driving a vehicle through WiFi and cellular 3G network coverage. Compared to an idealized solution that makes optimal use of all aggregated available networks but that lacks knowledge of application intent, Intentional networking improves the latency of interactive messages from 48% to 13x, while adding no more than 7% throughput overhead.
the Internet of things is an emerging paradigm shaping our current understanding about the future of Internet. Most of today's inter-enterprise applications follow the distributedcomputing paradigm in which parts...
详细信息
ISBN:
(纸本)9781467361149
the Internet of things is an emerging paradigm shaping our current understanding about the future of Internet. Most of today's inter-enterprise applications follow the distributedcomputing paradigm in which parts of the application are executed on different network-interconnected computers. the paper presents a state-of-the art review with a particular focus on resource management architectures, models and algorithms in Clouds and inter-Clouds for energy-efficient message delivery and covers the existing methods that support fault tolerance. the paper also presents a critical overview for existing methods focusing on delimiting the area of resource management, resource allocation, scalability, and fault tolerance in Clouds and inter-Clouds. the simulation will be an instrument for theoretical validation and a critical analysis of Cloud Simulators and identify the main benefits of each one will represent another important results
this paper presents a comparative study to examine the relationship between autonomic computing and persistent computing from the various aspects including motivation problems, ideas, purposes, goals, underlying princ...
详细信息
ISBN:
(纸本)0769522815
this paper presents a comparative study to examine the relationship between autonomic computing and persistent computing from the various aspects including motivation problems, ideas, purposes, goals, underlying principles, design methodologies, and architectures.
Since the beginning of the ubiquitous computing era, context-aware applications have been envisioned and pursued, with location and especially proximity information being one of the primary building blocks. To date, t...
详细信息
ISBN:
(纸本)9781467377010
Since the beginning of the ubiquitous computing era, context-aware applications have been envisioned and pursued, with location and especially proximity information being one of the primary building blocks. To date, there is still a lack of feasible solutions to perform proximity tests between mobile entities in a privacy-preserving manner, i.e., one that does not disclose one's location in case the other party is not in proximity. In this paper, we present our novel approach based on location tags built from surrounding Wi-Fi signals originating only from mobile devices. Since the set of mobile devices at a given location changes over time, this approach ensures the user's privacy when performing proximity tests. To improve the robustness of similarity calculations, we introduce a novel extension of the commonly used cosine similarity measure to allow for weighing its components while preserving the signal strength semantics. Our system is evaluated extensively in various settings, ranging from office scenarios to crowded mass events. the results show that our system allows for robust short-range proximity detection while preserving the participants' privacy.
Follow Me Cloud (FMC) concept has emerged as a promising technology that allows seamless migration of services according to the corresponding users' mobility. Meanwhile, Software Defined networking (SDN) is a new ...
详细信息
ISBN:
(纸本)9781467377010
Follow Me Cloud (FMC) concept has emerged as a promising technology that allows seamless migration of services according to the corresponding users' mobility. Meanwhile, Software Defined networking (SDN) is a new paradigm that permits to decouple the control and data planes of traditional network, and provides programmability and flexibility, allowing the network to dynamically adapt to changing traffic patterns and user demands. While the SDN implementations are gaining momentum, the control plane, however, is still suffering from scalability and performance concerns for a very large network. In this paper, we address these scalability and performance issues by introducing a novel SDN/Open Flow-based architecture and control plane framework tailored for mobile cloud computing systems and more specifically for FMC-based systems where mobile nodes and network services are subject to constraints of movements and migrations. Contrary to centralized approach with single SDN controller, our approach permits to distribute the SDN/OpenFlow control plane on a two-level hierarchical architecture: a first level with a global controller G-FMCC, and second level with several local controllers L-FMCC(s). thanks to our control plane framework and Network Function Virtualization concept (NFV), the L-FMCC(s) are deployed on-demand, where and when needed, depending on the global system load. Results obtained via analysis show that our solution ensures more efficient management of control plane, performances maintaining and network resources preservation.
In recent years, edge computing has emerged as a promising solution in the field of network computing. this architecture ensures the availability of distributedcomputing resources located closer to end-users and IoT ...
详细信息
ISBN:
(纸本)9798350377873;9798350377866
In recent years, edge computing has emerged as a promising solution in the field of network computing. this architecture ensures the availability of distributedcomputing resources located closer to end-users and IoT devices. However, resource scheduling remains a significant challenge in edge computing, requiring effective strategies to optimize resource utilization and ensure efficient task allocation. In this paper, we propose two hybrid approaches that combine the NawazEnscore-Ham (NEH) algorithm with local search and Greedy Random Adaptive Search Procedure (GRASP) algorithm with local search for modeling and solving data traffic in distributed edge computing environments (DPSDEC). through extensive evaluations, we consistently observe that the NEH algorithm outperforms GRASP, delivering minimized makespan and generating efficient schedules. Moreover, the NEH algorithm performs very well in less complex situations and maintains this advantage even in larger and more complex problems.
暂无评论