for Journals by Title or ISSN for Articles by Keywords help

Publisher: Springer-Verlag   (Total: 2335 journals)

 Annals of Telecommunications   [SJR: 0.315]   [H-I: 25]   [7 followers]  Follow         Hybrid journal (It can contain Open Access articles)    ISSN (Print) 1958-9395 - ISSN (Online) 0003-4347    Published by Springer-Verlag  [2335 journals]
• The design of the gateway for the Cloud of Things
• Authors: Riccardo Petrolo; Roberto Morabito; Valeria Loscrì; Nathalie Mitton
Pages: 31 - 40
Abstract: Abstract The increasing momentum of the Internet of Things (IoT) leaded to the development of a huge number of applications in different domains. Those applications are based on different standards and protocols, making therefore the IoT landscape widely fragmented. In this context, the evolution of Web semantic technologies together with the popularity of Cloud computing represents a solution to enable the horizontal integration of various IoT applications and platforms. This is what the Cloud of Things (CoT) aims to achieve. In this paper, we propose the design of a gateway for the Cloud of Things. The proposed gateway is able to manage semantic-like things and at the same time to act as an end-point for the presentation of data to users. Moreover, thanks to the use of virtualized software—which introduces a negligible impact in terms of performance—the gateway enables a lightweight and dense deployment of services. The paper describes the above technologies and how to combine them in order to design the gateway. Furthermore, we provide information about use cases, hardware, performance evaluation, and future hints to enhance the gateway.
PubDate: 2017-02-01
DOI: 10.1007/s12243-016-0521-z
Issue No: Vol. 72, No. 1-2 (2017)

• A secure cloud based Personal Health Record framework for a multi owner
environment
• Authors: D. Sangeetha; V. Vaidehi
Pages: 95 - 104
Abstract: Abstract Personal Health Record (PHR) is an upcoming online service model for sharing health information. It helps patients to create, control, and share their health information with other users as well as healthcare providers. When PHR is outsourced to a third party semi trusted server, issues such as unauthorized access, privacy, and security concerns arise which remains an open challenge in a multi owner cloud environment. To overcome these challenges, a secure cloud based PHR framework for sharing PHRs among multiple users using attribute-based encryption (ABE) is proposed. In this proposed framework, patients can encrypt their PHRs and store them on semi trusted cloud servers. Moreover, patients can maintain control over access to their PHRs by assigning fine-grained, attribute-based access privileges to chosen data users. In order to achieve fine-grained access control, the proposed PHR framework is divided into personal domain (PSDs) and public domain (PUDs). To ensure security in a cloud based PHR framework, a secure key-policy attribute-based encryption (S-KP-ABE) and privacy preserving decentralized collusion resistant attribute-based encryption (PP-DCR-ABE) algorithm is implemented in the PSDs and PUDs, respectively. From the experimental analysis, it is shown that the proposed cloud based PHR framework improves the efficiency of the system in terms of encryption, decryption, and key generation time in both the domains. Also, the proposed framework is proved to be collusion resistant and the security analysis ensures privacy preservation, trustworthiness between user and authorities, thereby enhancing the security of PHR users in a multi owner environment.
PubDate: 2017-02-01
DOI: 10.1007/s12243-016-0529-4
Issue No: Vol. 72, No. 1-2 (2017)

• The road to dynamic Future Internet via content characterization
• Abstract: Abstract The Internet evolved from a network with a few terminals to an intractable network of millions of nodes. Recent interest in information-centric networks (ICNs) is gaining significant momentum as a Future Internet paradigm. The key question is, hence, how to model the massive amount of connected nodes with their content requests in dynamic paradigm. In this paper, we present a novel method to characterize data requests based on content demand ellipse (CDE), focusing on efficient content access and distribution as opposed to mere communication between data consumers and publishers. We employ an approach of a promising eminence, where requests are characterized by type and popularity. Significant case studies are used to demonstrate that critical properties of ellipses may be used to characterize the content request irregularity during peak times. Depending on the degree of irregularity, the curve we plot becomes elliptic with a positive eccentricity less than one and an orientation centered with a bias. Real traffic data have been used to demonstrate how various data demand/request types affect eccentricity, orientation, and bias. Through simulations, we propose a dynamic resource allocation framework for Virtual Data Repeaters (VDRs) by correlating the resource allocation schema with the factors that affect the CDE in ICN.
PubDate: 2017-04-01

• Signals of opportunity geolocation methods for urban and indoor
environments
• Abstract: Abstract Motivated by the geolocation requirements of future mobile network applications such as portable internet of things (IoT) devices and automated airborne drone systems, this paper aims to provide techniques for improving device geolocation estimates in urban and indoor locations. In these applications low size, weight and power are vital design constraints. This paper proposes methods for improving the geolocation estimate available to a system in indoor and urban environments without the need for addition sensing or transmitting hardware. This paper proposes novel system application techniques that enable the integration of signals of opportunity, providing a robust geolocation estimate without any additional hardware. The proposed method utilises a sinusoidal Kalman filter architecture to analyse raw radio frequency (RF) signals that surround a system in urban and indoor environments. The introduced techniques efficiently analyse the raw RF data from any signal of opportunity and combine it with higher level geolocation sensors to provide an improved geolocation estimate. The improvements achieved by the system in a range of environments have been simulated, analysed and compared to the results obtained using the prior art. These improvements have been further validated and benchmarked by hardware test. The results obtained provide evidence that the efficient use of signals of opportunity coupled with common navigation sensors can provide a robust and reliable geolocation system in indoor and urban environments.
PubDate: 2017-04-01

• Path planning for mobile DCs in future cities
• Abstract: Abstract In future smart-cities, public transportation vehicles are planned to serve as data couriers (DCs) in order to exchange massive amounts of data chunks. In this research, we study the path planning problem for these DCs while optimizing their counts and their total traveled distances. As the total collected load on a given DC route cannot exceed its storage capacity, it is important to decide on the size of the exchanged data-packets (images, videos, etc.) and the sequence of the targeted data sources to be visited. We propose a hybrid heuristic approach for public data delivery in smart-city settings. In this approach, public vehicles are utilized as DCs that read/collect data from numerously distributed Access Points (APs) and relay it back to a central processing base-station in the city. We also introduce a cost-based fitness function for DCs election in the smart-city paradigm. Our cost-based function considers resource limitations in terms of DCs count, storage capacity, and energy consumption. Extensive simulations are performed, and the results confirm the effectiveness of the proposed approach in comparison to other heuristic approaches with respect to total traveled distances and overall time complexity.
PubDate: 2017-04-01

• An enhanced mutual authentication and key agreement scheme for mobile user
roaming service in global mobility networks
• Abstract: Abstract Roaming service is required in the ubiquitous access used in the global mobility networks (GLOMONETs) and the security is one of the most important issues. Many researchers focus their interests on authentication schemes for GLOMONETs. In 2015, Gope and Hwang, Zhang et al. and Farash et al. proposed their key agreement authentication schemes for GLOMONETs, respectively. However, we find weaknesses in them. Gope and Hwang’s scheme is under the off-line guessing attack and the de-synchronization attack. Moreover, it does not keep strong forward security and the session key is known by the home agent. Zhang et al.’s scheme has several weaknesses including vulnerability to the off-line guessing attack, destitution of password change phase, and the leakage of updated session key. Farash et al.’s scheme lacks user anonymity and strong forward secrecy and is vulnerable to the off-line password guessing attack. The session key is known to the home agent, too. Furthermore, neither Gope and Hwang’s scheme nor Farash et al.’s scheme has the session key update phase. To eliminate the problems, we present an improved authentication and key agreement scheme for GLOMONETs. According to the formal proof and the informal analysis, our scheme is well-performed and applicable.
PubDate: 2017-04-01

• On energy efficiency in underwater wireless sensor networks with
cooperative routing
• Abstract: Abstract In this paper, we exploit cooperative communication for designing an energy-efficient routing algorithm in underwater wireless sensor networks (UWSNs). Each network node is equipped with a single omnidirectional antenna and multiple node coordinates while taking advantage of spatial diversity. This research work is limited in scope to amplify-and-forward (AF) scheme at the relay node and fixed ratio combining (FRC) strategy at the receiver node. Cooperative diversity at the physical layer and multi-hop routing at the network layer enable us to formulate minimum energy routing as a joint optimization of the transmission power at physical layer and link selection at the network layer. Simulations results show that our proposed cooperative energy-efficient routing for UWSN (Co-EEUWSN) performs better than the selected non-cooperative routing protocols (depth-based routing (DBR) and energy-efficient DBR (EEDBR)) and cooperative DBR (Co-DBR) in terms of packet delivery ratio, end-to-end delay, and energy efficiency.
PubDate: 2017-04-01

• Majority-consensus fusion approach for elderly IoT-based healthcare
applications
• Abstract: Abstract Nowadays, tremendous growth of Internet of Things (IoT) applications is seen in smart environments such as medical remote care applications which are crucial due to the general aging of the population. With the recent advancements in IoT-based healthcare technologies, activity recognition can be used as the key part of the intelligent healthcare systems to monitor elderly people to live independently at homes and promote a better care. Recently, the evidence theory and its derivates approaches began to take place in the fields of activity recognition in these smart systems. However, these approaches are generally inconsistent with the probability calculus due to the lower and upper probability bounds considering the combined evidences. To overcome these challenges and to get more precisely the reconcilement between the evidence theory with the frequentist approach of probability calculus, this work proposes a new methodology for combining beliefs, addressing some of the disadvantages exhibited by the evidence theory and its derivatives. This methodology merges the non-normalized conjunctive and the majority rules. The proposed rule is evaluated in numerical simulation case studies involving the activity recognition in a smart home environment. The results show that this strategy produces intuitive results in favor of the more committed hypothesis.
PubDate: 2017-04-01

• Securing wireless sensor networks for improved performance in cloud-based
environments
• Abstract: Abstract Cloud computing has a great potential to assist in storing and processing data collected from sensors placed in any environment such as smart homes, vehicles, hospitals, enemy surveillance areas, volcanoes, oceans, etc. The sensors may be implanted in the form of a body sensor network or placed in the surroundings. The data recorded by these sensors may further be used for several applications implemented in the cloud as well as other services. Here, the data is acquired from sensors through the wireless medium. Recent studies show that wireless sensor networks (WSNs) are vulnerable to various kinds of security threats and there is a requirement of a security solution that safeguards them from lethal attacks. In this paper, we modify the low-energy adaptive clustering hierarchy (LEACH) protocol for WSNs and add the functionality of intrusion detection to secure WSNs from sinkhole, black hole, and selective forwarding attacks. The modified protocol is called LEACH++. We perform two types of analyses: numerical analysis to check the effect on throughput and energy, and simulations in Network Simulator-2 (NS-2) to prove the results found from the numerical analysis. The results are quite promising and favor LEACH++ over LEACH under attack with respect to throughput and energy consumption.
PubDate: 2017-03-22

• Multi-user searchable encryption with a designated server
• Authors: Zhen Li; Minghao Zhao; Han Jiang; Qiuliang Xu
Abstract: Abstract Multi-user searchable encryption (MSE) enables authorized users to search over encrypted documents in the cloud. Generally, security problems in existing MSE schemes are solved as follows: (1) transmitting authority values and search tokens through secure channels to resist keyword guessing attack; (2) involving a trusted third party (TTP) to manage users and (3) relying on online users to distribute the decryption keys. However, these methods result in extra overhead and heavily restrict the scalability of the systems. In this paper, we propose a secure channel-free and TTP-free MSE scheme. It is secure against keyword guessing attack by introducing a designated server. And it achieves fine-grained access control to grant and revoke the privileges of users without TTP. More specifically, each document is encrypted with a unique and independent key, where the key distribution is integrated with user authorization and search procedures. We provide a concrete construction of the scheme and give formal proofs of its security in the random oracle model.
PubDate: 2017-03-14
DOI: 10.1007/s12243-017-0571-x

• An improved tracking algorithm of floc based on compressed sensing and
particle filter
• Authors: Xin Xie; Huiping Li; Fengping Hu; Mingye Xie; Nan Jiang; Huandong Xiong
Abstract: Abstract In order to solve the problem of tracking flocs during complex flocculating process, we propose an improved algorithm combining particle filter (PF) with compressed sensing (CS). The feature of flocs image is extracted via CS theory, which is used to detect the single-frame image and get the detection value. Simultaneously, the optimal estimation of particle in the space model of non-linear and non-Gaussian state is obtained by PF. Then, we correlate the optimal estimate with the detected value to determine the trajectory of each particle and to achieve flock tracking. Experimental results demonstrate that this improved algorithm realizes the real-time tracking of flocs and calculation of sedimentation velocity. In addition, it eliminates the shortcomings of heavy computation and low efficiency in the process of extracting image features , and thus guarantees the accuracy and efficiency of tracking flocs.
PubDate: 2017-03-09
DOI: 10.1007/s12243-017-0572-9

• GA3: scalable, distributed address assignment for dynamic data center
networks
• Authors: Elisa Rojas; Joaquin Alvarez-Horcajo; Isaias Martinez-Yelmo; Jose M. Arco; Juan A. Carral
Abstract: Abstract Deployment and maintenance of current data center networks is costly and prone to errors. In order to avoid manual configuration, many of them require centralized administrators which constitute a clear bottleneck, while distributed approaches do not guarantee sufficient flexibility or robustness. This paper describes and evaluates GA3 (Generalized Automatic Address Assignment), a discovery protocol that assigns multiple unique labels to all the switches in a hierarchical network, without any modification of hosts or the standard Ethernet frames. Labeling is distributed and uses probes. These labels can be leveraged for shortest path routing without tables, as in the case of the Torii protocol, but GA3 also allows other label-based routing protocols (such as PortLand or ALIAS). Additionally, GA3 can detect miswirings in the network. Furthermore, control traffic is only necessary upon network deployment rather than periodically. Simulation results showed a reduced convergence time of less than 2 s and 100 kB/s of bandwidth (to send the GA3 frames) in the worst case for popular data center topologies, which outperforms other similar protocols.
PubDate: 2017-02-20
DOI: 10.1007/s12243-017-0569-4

• Wireless and mobile sensing technologies for the future Internet
• Authors: Abdelouahid Derhab; Mohamed Guerroumi; Mohamed Younis
PubDate: 2017-02-15
DOI: 10.1007/s12243-017-0570-y

• IT governance and risk mitigation approach for private cloud adoption:
case study of provincial healthcare provider
• Authors: Ayo Gbadeyan; Sergey Butakov; Shaun Aghili
Abstract: Abstract Cloud computing (CC) has the potential to provide significant benefits to healthcare organizations; however, its susceptibility to security and privacy apprehensions needs to be addressed before its adoption. It is important to evaluate the risks that arise from CC prior to its adoption in healthcare projects. Failure to evaluate security and privacy concerns could result in regulatory penalties, reputation loss, financial issues, and public loss of confidence in the healthcare provider. This paper uses Alberta’s Privacy Impact Assessment (PIA) requirement and COBIT 5 for Risk as guidance to highlight CC risk assessment areas and presents an IT governance and risk mitigation approach useful for CC adoption in the healthcare industry. In compliance with Alberta’s Health Information Act (HIA), the risk assessment areas are analyzed based on the security triad with emphasis on the confidentiality principle where privacy is the main focus. The proposed approach presented in this paper can be utilized by healthcare providers to mitigate and continuously evaluate CC risks from an IT governance perspective. Although the case study uses Canadian regulations, similar considerations can be taken into account in other jurisdictions.
PubDate: 2017-02-15
DOI: 10.1007/s12243-017-0568-5

• Security and management framework for an organization operating in cloud
environment
• Authors: Nasir Raza; Imran Rashid; Fazeel Ali Awan
Abstract: Abstract Cloud computing has attained tremendous popularity recently, leading to its fast and rapid deployment. However, privacy and security concerns have also increased in the same ratio. The adoption of cloud model has revealed new dimensions of attack, demanding major reconsideration and reevaluation of traditional security mechanisms. If an organization is operating in cloud environment without adopting essential security measures, it may face catastrophic consequences including loss of valuable data, financial damages, or reputation loss etc. Any organization in cloud architecture faces severe security threats and challenges for which a comprehensive security framework is needed. Certain frameworks exist in literature which focus deeply on specific cloud security issues; however, there is a dire need of comprehensive framework encompassing both security-related and management-related issues. This paper initially reviews security challenges and threats to data/applications in cloud environment. Furthermore, a comprehensive security and management framework is proposed for an organization operating in cloud environment. Proposed framework has been implemented in virtualized cloud environment to validate the efficacy of certain features of the model. The data center has been setup in virtualized environment through virtual machines on VMware ESXi-6 hypervisor layer. VMware vCloud-6 has been installed on top of it for provision of services to the users. The proposed framework is a set of guidelines that will adequately secure the organization’s data and applications. The framework incorporates a layered security architecture to achieve utmost level of security for nullifying the impact of threats.
PubDate: 2017-02-10
DOI: 10.1007/s12243-017-0567-6

• Virtual coordinate system using dominating set for GPS-free adhoc networks
• Authors: Shailendra Shukla; Rajiv Misra; Abhishek Agarwal
Abstract: Abstract Reported work on virtual coordinate assignment (VCA) schemes are iterative-based techniques which rely upon geometric projection (i.e., projecting on circle) or embedding of network topology to low-dimensional Euclidean space (like graph embedding, multidimensional scaling). The performance of existing VCA techniques is constrained by topological situations such as low density or having voids/holes, where greedy forwarding suffers due to local minima when no neighbor is found closer to the destination or low-quality routes comprised of long distance hops. Another drawback of existing VCA techniques is the requirement of thousand iterations for usable coordinate convergence. In order to overcome these drawbacks, we propose a novel virtual coordinate construction technique using graph-theoretic dominating sets. Dominating set (DS) of G is a subset of vertices such that each vertex in G is either in DS or has a neighbor in DS. We found that our virtual coordinate assignment using dominating set algorithm has an approximation ratio $$((4.8+\ln 5)opt +1.2)$$ , where opt is the minimum size dominating set which has the same approximation ratio as minimum dominating set problem. Our algorithm has time complexity $$\mathcal {O}(n)$$ times and $$\mathcal {O}(D)$$ rounds and message complexity is $$\mathcal {O}(n\log n)$$ , where D is the radius and n is the number of nodes in networks.
PubDate: 2017-02-08
DOI: 10.1007/s12243-017-0563-x

• Femtocells in centralized systems: green operation and radio resource
management techniques
• Authors: Elias Yaacoub
Abstract: Abstract In this paper, a system of femtocells controlled by a single controller is investigated. In such a scenario, femtocell access points (FAPs) are assumed connected via wired links to a central controller within a certain vicinity (e.g., building, compound, hotel, and campus.). Thus, radio resource management (RRM) and green network operation of LTE femtocell networks are investigated in an integrated wired/wireless system. Consequently, it becomes possible to perform RRM in a centralized and controlled way in order to enhance the quality of service (QoS) performance for the users in the network. Furthermore, energy-efficient operation consisting of switching off redundant FAPs can be implemented. A utility maximization framework is presented, and an RRM algorithm that can be used to maximize various utility functions is proposed. Another algorithm is presented for the scenario of FAP on/off switching to achieve green operation. It consists of selecting the best FAP to switch off, then moving the femto user equipments (FUEs) to other active FAPs without compromising their quality of service (QoS). Simulation results show that the proposed algorithms lead to significant performance gains.
PubDate: 2017-02-04
DOI: 10.1007/s12243-017-0565-8

networks
• Authors: Zouina Doukha; Sofian Ali BenMussa; Kayhan Zrar Ghafoor; Iman Loumachi; Samira Moussaoui
Abstract: Abstract Neighborhood discovery is a fundamental link layer service for safety and non-safety applications in VANETs. Till now, this service is made available by beaconing. But, several studies demonstrate its inefficiency. In the literature, several papers propose adaptive strategies to alleviate the channel load problem, but packet loss due to collision remains an open issue due to the randomness of beacon sending through the network. In this paper, we propose an SDMA-based beaconing with load balancing method that distributes beacon sending load fairly. In the proposed scheme, the vehicles self-organize themselves into groups depending on their positions. Then, all beacons are sent sequentially along the period, thereby reducing the congestion. We drive extensive simulations to demonstrate the effectiveness of our strategy.
PubDate: 2017-02-04
DOI: 10.1007/s12243-017-0562-y

• Activities scheduling algorithms based on probabilistic coverage models
for wireless sensor networks
• Authors: Mohammed Boudali; Mustapha Reda Senouci; Mohamed Aissani; Walid-Khaled Hidouci
Abstract: Abstract Area monitoring using Internet and barrier coverage is a typical application of wireless sensor networks. The main concerns in this type of applications are coverage efficiency and sensor energy conservation. For that, many activities scheduling algorithms are proposed in the literature. Unlike prior efforts based on an unrealistic binary sensor coverage model, this paper proposes three efficient activities scheduling algorithms based on realistic sensor coverage models. The first algorithm (C1L-PBC) is centralized and it is based on a coverage graph. The second algorithm (D1L-PBC) is distributed and it ensures 1-barrier coverage; whereas, the third one (D2L-PBC) is also distributed and it guarantees 2-barrier coverage. The obtained experimental results show that the proposed algorithms can effectively guarantee the barrier coverage and prolong the sensor network lifetime.
PubDate: 2017-02-01
DOI: 10.1007/s12243-017-0564-9

• Cloudification of the internet of things
PubDate: 2016-12-21
DOI: 10.1007/s12243-016-0555-2

JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327

Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs