Showing papers in "Computer Communications in 2007"

TL;DR: A taxonomy and general classification of published clustering schemes for WSNs is presented, highlighting their objectives, features, complexity, etc and comparing of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.

TL;DR: The fast progress of research on energy efficiency, networking, data management and security in wireless sensor networks, and the need to compare with the solutions adopted in the standards motivates the need for a survey on this field.

TL;DR: This paper provides a survey of key management schemes in wireless sensor networks and notices that no key distribution technique is ideal to all the scenarios where sensor networks are used; therefore the techniques employed must depend upon the requirements of target applications and resources of each individual sensor network.

TL;DR: This paper proposes a novel agent-based trust and reputation management scheme (ATRM) for wireless sensor networks, and proves its correctness and extensive performance evaluation results, which clearly show thatTrust and reputation can be computed in wireless Sensor networks with minimal overhead.

TL;DR: Several soft computing techniques are incorporated into the classifying system to detect and classify intrusions from normal behaviors based on the attack type in a computer network, including neuro-fuzzy networks, fuzzy inference approach and genetic algorithms.

TL;DR: By using overhearing characteristics of wireless communication, PEACH forms clusters without additional overhead and supports adaptive multi-level clustering and can be used for both location-unaware and location-aware wireless sensor networks.

TL;DR: In this article, the authors study three different trajectories for the mobile landmark, namely, Scan, Double Scan, and Hilbert, and show that any deterministic trajectory that covers the whole area offers significant benefits compared to a random movement of the landmark.

TL;DR: DGR improves the average video peak signal-to-noise ratio (PSNR) by 3dB, compared to a traditional geographic routing scheme, and has the following advantages: lower delay, substantially longer network lifetime, and a better received video quality.

TL;DR: A protocol to track a mobile object in a sensor network dynamically and how to query target tracks and obtain the target position effectively is proposed, which has better performance than that of flooding-based query methods.

TL;DR: A centralized and deterministic sensor deployment method, DT-Score (Delaunay Triangulation-Score), aims to maximize the coverage of a given sensing area with obstacles and can reach higher coverage than grid-based and random deployment methods with the increasing of deployable sensors.

TL;DR: This paper systematically discuses the performance evaluation and comparison of four typical routing protocols of ad hoc networks with the different simulation model and metrics, and drew more complete and valuable conclusions.

TL;DR: This work defines the maximum energetically sustainable workload (MESW) as the objective function to be used to drive the optimization of routing algorithms for EH-WSNs, and proposes a methodology that makes use of graph algorithms and network simulations for evaluating the MESW.

TL;DR: A novel algorithm is presented that first finds a list of suspected nodes through checking data consistency, and then effectively identifies the intruder in the list through analyzing the network flow information, and is robust to deal with multiple malicious nodes that cooperatively hide the real intruder.

TL;DR: A systematical investigation of current state-of-the-art algorithms for the energy-aware multicast routing problem and the MLB/MLM problem in wireless ad hoc networks with omni-directional and directional antennas is presented.

TL;DR: A new routing protocol called SEEM: Secure and Energy-Efficient multipath Routing protocol, which uses multipath alternately as the path for communicating between two nodes thus prolongs the lifetime of the network.

TL;DR: An effective optimization framework is proposed, where genetic algorithm (GA) and particle swarm optimization (PSO) algorithm are hybridized to enhance the searching ability and reveal that the proposed optimization framework can flexibly deal with a multi-objective optimization problem.

TL;DR: This work proposes a collision-free centralized scheduling algorithm for IEEE 802.16 based Wireless Mesh Networks to provide high-quality wireless multimedia services and designs a relay strategy for the mesh nodes in a transmission tree, taking special considerations on fairness, channel utilization and transmission delay.

TL;DR: This paper introduces service-oriented SANETs (SOSANETs) as a novel approach for building a new generation of open, efficient, interoperable, scalable, application-aware SANets and investigates the benefits of SOSANets in the context of TinySOA, a prototype SOSANET that was developed on top of TinyOS.

TL;DR: Compared with the conventional EPSP, although LSSP increases moderate backup resources consumption, it not only can provide 100% protection ability for multiple failures but also can perform much faster recovery time and easier survivable operation and management.

TL;DR: This paper proposes to use a small number of mobile robots to replace failed sensors for a large-scale static sensor network and studies algorithms for detecting and reporting sensor failures and coordinating the movement of robots that minimize the motion energy of mobile Robots and the messaging overhead incurred to the sensor network.

TL;DR: This paper proposes a location multipath routing-based method by extension of LAR, a performance evaluation and comparison of four routing protocols for ad hoc networks and discusses the solutions for security in a MANET briefly.

TL;DR: A novel atypical application of collective social agents to guide the formation of clusters that allows the protocol to converge fast with very limited overhead and to ensure a good distribution of clusterheads through a totally distributed approach.

TL;DR: Simulation results have demonstrated that the proposed scheme can provide not only better energy efficiency as compared to those obtained by conventional methods which assume random waypoint for the mobile sink, but also fault-resilience in case of malfunctions of some sensors due to attacks.

TL;DR: Two schemes are proposed: AODV-ABR and AODVs-ABL to increase the adaptation of routing protocols to topology changes by modifying A ODV-BR and a performance improvement is evaluated by simulations.

TL;DR: This work designs a window-less block acknowledgment scheme that guarantees continuous packet forwarding and replicates the acknowledgment for a packet, and designs mechanisms to handle varying ack-delay and to reduce delay in timer-based retransmissions and achieves a close-to-optimal goodput.

TL;DR: This paper considers a probabilistic sensing model that provides different sensing capabilities in terms of coverage range and detection quality with different costs and an approximate solution is proposed based on a two-dimensional genetic algorithm.

TL;DR: This paper studies the fine-tuning of broadcasting strategies by using a cellular multi-objective genetic algorithm (cMOGA) which computes a Pareto front of solutions to empower a human designer with the ability of choosing the preferred configuration for the network.

TL;DR: A flexible and cost-effective Radio-over-Fiber (RoF) based network architecture to support indoor networking at millimeter wave bands is proposed and the concept of Extended Cell is introduced.

TL;DR: The security analysis results indicate that the proposed design can prevent and detect malicious nodes with a high probability of success by cluster-based and neighbor monitor mechanisms.

TL;DR: This paper presents a novel intrusion detection model based on artificial immune and mobile agent paradigms for network intrusion detection, which is host-based and adopts the anomaly detection paradigm.