Scispace (Formerly Typeset)
  1. Home
  2. Journals
  3. Computer Communications
  4. 2013
  1. Home
  2. Journals
  3. Computer Communications
  4. 2013
Showing papers in "Computer Communications in 2013"
Journal Article•10.1016/J.COMCOM.2013.01.005•
A case for stateful forwarding plane

[...]

Cheng Yi1, Alexander Afanasyev2, Ilya Moiseenko2, Lan Wang3, Beichuan Zhang1, Lixia Zhang2 •
University of Arizona1, University of California, Los Angeles2, University of Memphis3
01 Apr 2013-Computer Communications
TL;DR: An initial design of NDN's forwarding plane is described and the results show that this stateful forwarding plane can successfully circumvent prefix hijackers, avoid failed links, and utilize multiple paths to mitigate congestion.

639 citations

Journal Article•10.1016/J.COMCOM.2013.09.004•
Review: The role of communication systems in smart grids: Architectures, technical solutions and research challenges

[...]

Emilio Ancillotti1, Raffaele Bruno1, Marco Conti1•
National Research Council1
01 Nov 2013-Computer Communications
TL;DR: The fundamental research challenges in this field including communication reliability and timeliness, QoS support, data management services, and autonomic behaviors are introduced and the main solutions proposed in the literature for each are discussed.

378 citations

Journal Article•10.1016/J.COMCOM.2013.01.009•
Network of Information (NetInf) - An information-centric networking architecture

[...]

Christian Dannewitz1, Dirk Kutscher, Börje Ohlman2, Stephen Farrell3, Bengt Ahlgren4, Holger Karl1 •
University of Paderborn1, Ericsson2, Trinity College, Dublin3, Swedish Institute of Computer Science4
01 Apr 2013-Computer Communications
TL;DR: The results suggest that a scalable NRS for 10^1^5 and more objects with resolution latencies (well) below 100ms is possible, implying that a global Network of Information that removes the need for today's application-specific overlay solutions is feasible.

341 citations

Journal Article•10.1016/J.COMCOM.2012.10.010•
Static vs. mobile sink

[...]

Majid Iqbal Khan1, Wilfried N. Gansterer2, Guenter Haring2•
COMSATS Institute of Information Technology1, University of Vienna2
01 May 2013-Computer Communications
TL;DR: It turns out that in general the choice of the duty cycle value is more important for achieving energy efficiency than the choices of the mobility radius of the sink, especially in terms of Emax.

190 citations

Journal Article•10.1016/J.COMCOM.2013.07.003•
VANET QoS-OLSR: QoS-based clustering protocol for Vehicular Ad hoc Networks

[...]

Omar Abdel Wahab1, Hadi Otrok2, Azzam Mourad1•
Lebanese American University1, Khalifa University2
01 Jul 2013-Computer Communications
TL;DR: Performance analysis and simulation results show that the proposed model can maintain the network stability, reduce the end-to-end delay, increase the packet delivery ratio, and reduce the communications overhead.

184 citations

Journal Article•10.1016/J.COMCOM.2012.10.005•
Review: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

[...]

Jiguo Yu1, Nannan Wang1, Guanghui Wang2, Dongxiao Yu3•
Qufu Normal University1, Shandong University2, University of Hong Kong3
01 Jan 2013-Computer Communications
TL;DR: A comprehensive survey for CDSs and related problems with various network models and specific applications is given and some open problems and interesting issues in this field are proposed.

169 citations

Journal Article•10.1016/J.COMCOM.2013.03.003•
Egocentric online social networks: Analysis of key features and prediction of tie strength in Facebook

[...]

Valerio Arnaboldi1, Andrea Guazzini2, Andrea Passarella1•
National Research Council1, University of Florence2
01 Jun 2013-Computer Communications
TL;DR: A detailed analysis of a real Facebook data set aimed at characterising the properties of human social relationships in online environments finds that the recency of contact between individuals has the highest relevance in the prediction of tie strength.

137 citations

Journal Article•10.1016/J.COMCOM.2013.03.005•
SURF: A Distributed Channel Selection Strategy for Data Dissemination in Multi-Hop Cognitive Radio Networks

[...]

Mubashir Husain Rehmani, Aline Carneiro Viana, Hicham Khalife, Serge Fdida
01 Jun 2013-Computer Communications
TL;DR: This paper proposes an intelligent and distributed channel selection strategy, SURF, that classifies the available channels and uses them efficiently to increase data dissemination reliability in multi-hop cognitive radio networks.

122 citations

Journal Article•10.1016/J.COMCOM.2013.01.008•
Evaluating CCN multi-path interest forwarding strategies

[...]

Giuseppe Rossini1, Dario Rossi1•
Télécom ParisTech1
01 Apr 2013-Computer Communications
TL;DR: A thorough simulation study of the main system performance of Content Centric Networks, with a special focus on multi-path interest forwarding strategies but thoroughly analyzing the impact of several other ingredients - such as network topology, content popularity, caching decisions and replacement policies.

96 citations

Journal Article•10.1016/J.COMCOM.2013.04.003•
Trust-based security for the OLSR routing protocol

[...]

Asmaa Adnane1, Christophe Bidan2, Rafael Timóteo de Sousa Júnior•
University of Derby1, Supélec2
01 Jun 2013-Computer Communications
TL;DR: Trust-based analysis of the OLSR protocol using trust specification language is presented, and it is shown how trust-based reasoning can allow each node to evaluate the behavior of the other nodes and counter the malicious nodes.

63 citations

Journal Article•10.1016/J.COMCOM.2013.01.014•
Hierarchical DHT-based name resolution for information-centric networks

[...]

Christian Dannewitz1, Matteo D'Ambrosio2, Vinicio Vercellone2•
University of Paderborn1, Telecom Italia2
01 Apr 2013-Computer Communications
TL;DR: A general hierarchical NRS framework for flat ID namespaces is presented and results imply that a flat namespace can be adopted on a global scale, opening up several design alternatives for information-centric network architectures.
Journal Article•10.1016/J.COMCOM.2012.09.015•
A new class of Hash-Chain based key pre-distribution schemes for WSN

[...]

Walid Bechkit1, Yacine Challal1, Abdelmadjid Bouabdallah1•
University of Technology of Compiègne1
01 Feb 2013-Computer Communications
TL;DR: This paper proposes a hash-based mechanism which enhances the resiliency of key pre-distribution for WSN and gives birth to an enhanced scheme which is more resilient against node capture attacks.
Journal Article•10.1016/J.COMCOM.2012.07.016•
Real-time data report and task execution in wireless sensor and actuator networks using self-aware mobile actuators

[...]

Yuanyuan Zeng1, Deshi Li1, Athanasios V. Vasilakos2•
Wuhan University1, University of Western Macedonia2
01 May 2013-Computer Communications
TL;DR: A novel framework of real-time data report and task execution (RTRE) for automated WSANs in this paper takes advantage of mobile actuators to demonstrate the advantage of RTRE when compared with the other related work in terms of timeliness and energy efficiency.
Journal Article•10.1016/J.COMCOM.2012.09.002•
Impact of trust model on on-demand multi-path routing in mobile ad hoc networks

[...]

Hui Xia1, Zhiping Jia1, Lei Ju1, Xin Li1, Edwin H.-M. Sha •
Shandong University1
01 May 2013-Computer Communications
TL;DR: A trust prediction model to evaluate the trustworthiness of nodes, which is based on the nodes' historical behaviors and fuzzy logic rules prediction method is presented, which achieves a remarkable improvement in the packet delivery ratio, network throughput and malicious attack resistance.
Journal Article•10.1016/J.COMCOM.2012.09.007•
Spare capacity allocation using shared backup path protection for dual link failures

[...]

Victor Yu Liu1, David Tipper2•
Huawei1, University of Pittsburgh2
01 Mar 2013-Computer Communications
TL;DR: This paper extends the spare capacity allocation (SCA) problem from single link failure to dual link failures on mesh-like IP or WDM networks and compares the passive/active approaches which consider spare capacity sharing after/during the backup path routing process.
Journal Article•10.1016/J.COMCOM.2012.12.002•
ADMIRE: Anomaly detection method using entropy-based PCA with three-step sketches

[...]

Yoshiki Kanda1, Romain Fontugne2, Kensuke Fukuda2, Toshiharu Sugawara1•
Waseda University1, Graduate University for Advanced Studies2
01 Mar 2013-Computer Communications
TL;DR: A PCA-based anomaly detection algorithm called ADMIRE, which uses three-step sketches and an adaptive parameter setting to improve the detection performance and ease its use in practice, is proposed and evaluated.
Journal Article•10.1016/J.COMCOM.2012.07.021•
Prolonging network lifetime under probabilistic target coverage in wireless mobile sensor networks

[...]

Dimitrios Zorbas1, Tahiry Razafindralambo1•
French Institute for Research in Computer Science and Automation1
01 May 2013-Computer Communications
TL;DR: The problem of the minimum sampling quality, where an event must be sufficiently detected by the maximum possible amount of time, is described and a localized algorithm based on mobile nodes is presented, which sacrifices a part of the energy of the nodes by moving them to a new location in order to satisfy the desired detection accuracy.
Journal Article•10.1016/J.COMCOM.2013.05.002•
Distributed cooperative spectrum sensing in cognitive radio for ad hoc networks

[...]

Waleed Ejaz1, Najam Ul Hasan1, Hyung Seok Kim1•
Sejong University1
01 Jul 2013-Computer Communications
TL;DR: In this paper, a gradient-based fully distributed cooperative spectrum sensing in cognitive radio is proposed for ad hoc networks, in which the licensed band used for TV transmission is considered the primary user, and the gradient is calculated based on the components, which include energy sensed by secondary users and received from neighbors.
Journal Article•10.1016/J.COMCOM.2013.04.009•
Review: An overview of anonymity technology usage

[...]

Bingdong Li1, Esra Erdin1, Mehmet Hadi Gunes1, George Bebis1, Todd Shipley •
University of Nevada, Reno1
01 Jul 2013-Computer Communications
TL;DR: This paper provides a tutorial survey and a measurement study to understand the anonymity technology usage on the Internet from multiple perspectives and platforms and reveals that Tor and proxy servers are used more than other anonymity techniques.
Journal Article•10.1016/J.COMCOM.2013.03.001•
Comparison of PI controllers designed for the delay model of TCP/AQM networks

[...]

Hakkı Ulaş Ünal1, Daniel Melchor-Aguilar, Deniz Ustebay2, Silviu-Iulian Niculescu3, Hitay Özbay4 •
Anadolu University1, McGill University2, Supélec3, Bilkent University4
01 Jun 2013-Computer Communications
TL;DR: By utilizing the fluid-flow model of TCP networks, the PI controllers designed for TCP/AQM are studied to provide a guideline for choosing a PI controller for AQM given specific performance requirements.
Journal Article•10.1016/J.COMCOM.2012.12.008•
An energy consumption analysis of the Wireless HART TDMA protocol

[...]

Osama Khader1, Andreas Willig2•
Technical University of Berlin1, University of Canterbury2
01 Apr 2013-Computer Communications
TL;DR: The energy consumption characteristics of the Wireless HART protocol when operated with a popular transceiver, the ChipCon CC2420, are analyzed and it turns out that in light traffic scenarios and with only a minimum-complexity level of exploitation of the transceivers sleeping capabilities the energy spent in the sleep state over 12h is quite substantial.
Journal Article•10.1016/J.COMCOM.2012.12.004•
SIPAD: SIP-VoIP Anomaly Detection using a Stateful Rule Tree

[...]

Dongwon Seo1, Heejo Lee1, Ejovi Nuwere•
Korea University1
01 Mar 2013-Computer Communications
TL;DR: Experimental results of the proposed stateful SIP inspection mechanism, called SIP-VoIP Anomaly Detection (SIPAD), indicate that it dramatically reduces overhead and can be deployed in resource-constrained environments such as smartphones.
Journal Article•10.1016/J.COMCOM.2012.10.011•
INCOME: Practical land monitoring in precision agriculture with sensor networks

[...]

Shanshan Li1, Shaoliang Peng1, Weifeng Chen2, Xiaopei Lu1•
National University of Defense Technology1, California University of Pennsylvania2
01 Feb 2013-Computer Communications
TL;DR: This paper proposes an incremental deployment solution - INCOME - to solve the minimum sensor deployment problem, which does not require any prior knowledge of the dark/light distribution of the field, and formally proves that the sensor number needed in IN COME is less than that of regular division.
Journal Article•10.1016/J.COMCOM.2012.12.005•
Distributed multicast of fingerprinted content based on a rational peer-to-peer community

[...]

Josep Domingo-Ferrer1, David Megías2•
Rovira i Virgili University1, Open University of Catalonia2
01 Mar 2013-Computer Communications
TL;DR: This work presents a scalable solution for distributed multicast of fingerprinted content, in which receivers rationally co-operate in fingerprinting and spreading the content.
Journal Article•10.1016/J.COMCOM.2012.08.001•
Optimized secure and reliable distributed data storage scheme and performance evaluation in unattended WSNs

[...]

Yi Ren1, Vladimir A. Oleshchuk1, Frank Y. Li1•
University of Agder1
01 May 2013-Computer Communications
TL;DR: This paper proposes a secure and reliable data distribution scheme that can provide forward secrecy, probabilistic backward secrecy and data reliability, and shows the superiority of the proposed scheme in comparison with several existing schemes developed for UWSNs.
Journal Article•10.1016/J.COMCOM.2013.06.004•
Establishing connectivity among disjoint terminals using a mix of stationary and mobile relays

[...]

Ahmad Abbas1, Mohamed Younis1•
University of Maryland, Baltimore County1
01 Jul 2013-Computer Communications
TL;DR: This paper investigates the interconnection problem when the number of available RNs is insufficient for forming a stable topology and a mix of RNs and MDCs is to be used and presents a novel algorithm for determining where the RNs are to be placed and planning optimized travel paths for the MDC's so that the data delivery latency as well as the M DC motion overhead are minimized.
Journal Article•10.1016/J.COMCOM.2012.11.003•
Auctions and iMesh based task assignment in wireless sensor and actuator networks

[...]

Ivan Mezei1, Milan Lukic1, Veljko Malbasa1, Ivan Stojmenovic2•
University of Novi Sad1, University of Ottawa2
01 May 2013-Computer Communications
TL;DR: In this article, auctions are used to improve the recent information mesh (iMesh) based distance sensitive service discovery in the wireless sensor and actuator networks (WSANs), thus improving overall energy efficiency and lifetime of the network.
Journal Article•10.1016/J.COMCOM.2013.04.006•
A survey on applications of IEEE 802.21 Media Independent Handover framework in next generation wireless networks

[...]

Behrouz Shahgholi Ghahfarokhi1, Naser Movahhedinia1•
University of Isfahan1
01 Jun 2013-Computer Communications
TL;DR: This paper presents a comprehensive survey of the proposed mobility management mechanisms that are using Media Independent Handover, the standard addressing a uniform and media-independent framework for seamless handover between different access technologies.
Journal Article•10.1016/J.COMCOM.2012.10.008•
Effective channel assignments in cognitive radio networks

[...]

Jie Wu1, Ying Dai1, Yanchao Zhao1•
Temple University1
01 Feb 2013-Computer Communications
TL;DR: This paper designs two basic algorithms and an advanced algorithm framework for channel assignment in cognitive radio networks and shows that the proposed framework is fast (two rounds of communication among nodes, regardless of network size) and outperforms an existing method.
Journal Article•10.1016/J.COMCOM.2013.05.004•
Online NetFPGA decision tree statistical traffic classifier

[...]

Alireza Monemi1, Roozbeh Zarei1, Muhammad Nadzir Marsono1•
Universiti Teknologi Malaysia1
01 Jul 2013-Computer Communications
TL;DR: This paper proposes an online statistical traffic classifier using the C4.5 machine learning algorithm running on the NetFPGA platform that is able to classify the input traffics at the maximum line speed of the Net FPGA platform, i.e. 8Gbps without any packet loss.
...

Tools

SciSpace AgentBiomedical AgentSciSpace RecruitSciSpace for EnterpriseAgent GalleryChat with PDFLiterature ReviewAI WriterFind TopicsParaphraserCitation GeneratorExtract DataAI DetectorCitation Booster

Learn

ResourcesLive Workshops

SciSpace

CareersSupportBrowse PapersPricingSciSpace Affiliate ProgramCancellation & Refund PolicyTermsPrivacyData Sources

Directories

PapersTopicsJournalsAuthorsConferencesInstitutionsCitation StylesWriting templates

Extension & Apps

SciSpace Chrome ExtensionSciSpace Mobile App

Contact

support@scispace.com
SciSpace

© 2026 | PubGenius Inc. | Suite # 217 691 S Milpitas Blvd Milpitas CA 95035, USA

soc2
Secured by Delve