JGRAPH-HOC-Most Cited Articles

•

1 j'aime•804 vues

GRAPH-HOC is a quarterly open access peer-reviewed journal focuses on the applications of graph theory in different areas of wireless ad hoc networks such as Mobile Ad hoc Networks (MANETs), Vehicular Ad hoc Networks (VANETs) and sensor networks. Graph theoretic concepts are applied in several fundamental issues such as connectivity, data gathering, routing, mobility, energy efficiency and topology control. Papers submitted for the Journal should focus on a problem that is of both theoretical as well as practical interest in the area of ad hoc networks and sensor networks.

Technologie

International Journal on Applications of Graph Theory in Wireless Ad
hoc Networks and Sensor Networks (GRAPH-HOC)
ISSN : 0975-7031 Online) ; 0975-7260 (Print)
http://airccse.org/journal/graphhoc/GRAPH-HOC.html
Most Cited Articles - 2011
A Comparison of Link Layer Attacks on Wireless Sensor Networks
Shahriar Mohammadi and Hossein Jadidoleslamy, Graph-Hoc Journal, Vol.3, No.1, March 2011,
PP. 35-56 DOI : 10.5121/jgraphhoc.2011.3103
A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods
Maaly A. Hassan and Andrew Chickadel, Graph-Hoc Journal, Vol.3, No.1, March 2011, PP. 58-
67 DOI : 10.5121/jgraphhoc.2011.3104
Classification and Evaluation of Mobility Metrics for Mobility Model Movement Patterns in
Mobile Ad-Hoc Networks
Santosh Kumar S C Sharma Bhupendra Suman, Graph-Hoc Journal, Vol.3, No.3, September
2011, PP. 25-38 DOI : 10.5121/jgraphoc.2011.3303
Most Cited Articles - 2010
An Overview of Mobile Ad-Hoc Networks for the Existing Protocols and Applications
Saleh Ali K.Al-Omari and Putra Sumari, Graph-Hoc Journal, Vol.2, No.1,March 2010, PP. 87-
110 DOI : 10.5121/jgraphhoc.2010.2107
Secure Key Exchange and Encryption Mechanism for Group Communication in Wireless Ad
Hoc Networks
S. Sumathy and B.Upendra Kumar, Graph-Hoc Journal, Vol.2,No.1,March 2010, PP. 9 to 16
DOI : 10.5121/jgraphhoc.2010.2102
Coverage andConnectivity Aware Neural Network Based Energy Efficient Routing in Wireless
Sensor Networks
Neeraj Kumar, Manoj Kumar and R.B. Patel, Graph-Hoc Journal, Vol.2,No.1,March 2010, PP.
45-60 DOI : 10.5121/jgraphhoc.2010.2105
Simulated Annealing for Location Area Planning in Cellular Networks
N. B. Prajapati, R. R. Agravat and M. I. Hasan, Graph-Hoc Journal, Vol.2,No.1,March 2010, PP.
01-07 DOI : 10.5121/jgraphhoc.2010.2101
A Review Of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad Hoc
Networks
Busola S. Olagbegi and Natarajan Meghanathan, Graph-Hoc Journal, Vol.2, No.2, June 2010,
PP. 01-15 DOI : 10.5121/jgraphoc.2010.2201

I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet Forwarding
Technique for Wireless Sensor and Ad Hoc Networks
Kaushik Ghosh, Sarbani Roy and Pradip K. Das, Graph-Hoc Journal, Vol.2, No.2, June 2010,
PP. 34-44 DOI : 10.5121/jgraphoc.2010.2204
Case Study On Social Engineering Techniques for Persuasion
Mosin Hasan, Nilesh Prajapati and Safvan Vohara, Graph-Hoc Journal, Vol.2, No.2, June 2010,
PP. 17-23 DOI : 10.5121/jgraphoc.2010.2202
Constructing Minimum ConnectedDominating Set: Algorithmic Approach
G.N. Purohit and Usha Sharma, Graph-Hoc Journal, Vol.2, No.3, September 2010, PP. 59-66
DOI : 10.5121/jgraphoc.2010.2305
The Impact of Data Replicatino on Job Scheduling Performance in Hierarchical Data Grid
Somayeh Abdi, Hossein Pedram and Somayeh Mohamadi, Graph-Hoc Journal, Vol.2, No.3,
September 2010 , PP. 15-25
DOI : 10.5121/jgraphoc.2010.2302
A Review Of the Energy Efficient and Secure Multicast routing protocols for Mobile Ad Hoc
Networks
Busola S. Olagbegi and Natarajan Meghanathan, Graph-Hoc Journal, Vol.2, No.2, June 2010,
PP. 1 to 15
DOI : 10.5121/jgraphoc.2010.2201
AIRCC Publishing Corporation
www.airccse.org

Contenu connexe

Plus de graphhoc

We compare the probability of k-Connectivity of an ad hoc network under Random Way Point (RWP),City Section and Manhattan mobility models. A Network is said to be k Connected if there exists at least k edge disjoint paths between any pair of nodes in that network at any given time and velocity. Initially, for each of the three mobility models, the movement of the each node in the ad hoc network at a given velocity and time are captured and stored in the Node Movement Database (NMDB). Using the movements in the NMDB, the location of the node at a given time is computed and stored in the Node Location Database (NLDB).

ON THE PROBABILITY OF K-CONNECTIVITY IN WIRELESS AD HOC NETWORKS UNDER DIFFER...

graphhoc

In data-intensive applications data transfer is a primary cause of job execution delay. Data access time depends on bandwidth. The major bottleneck to supporting fast data access in Grids is the high latencies of Wide Area Networks and Internet. Effective scheduling can reduce the amount of data transferred across the internet by dispatching a job to where the needed data are present. Another solution is to use a data replication mechanism. Objective of dynamic replica strategies is reducing file access time which leads to reducing job runtime. In this paper we develop a job scheduling policy and a dynamic data replication strategy, called HRS (Hierarchical Replication Strategy), to improve the data access efficiencies. We study our approach and evaluate it through simulation. The results show that our algorithm has improved 12% over the current strategies

The Impact of Data Replication on Job Scheduling Performance in Hierarchical ...

graphhoc

An L (2, 1)-labeling of a graph G (also called distance two labeling) is a function f from the vertex set V (G) to the non negative integers {0,1,…, k }such that |f(x)-f(y)| ≥2 if d(x, y) =1 and | f(x)- f(y)| ≥1 if d(x, y) =2. The L (2, 1)-labeling number λ (G) or span of G is the smallest k such that there is a f with max {f (v) : vє V(G)}= k. In this paper we introduce a new type of graph called multi-storey graph. The distance two labeling of multi-storey of path, cycle, Star graph, Grid, Planar graph with maximal edges and its span value is determined. Further maximum upper bound span value for Multi-storey of simple graph are discussed.

DISTANCE TWO LABELING FOR MULTI-STOREY GRAPHS

graphhoc

Secure multicast communication in Mobile Adhoc Networks (MANETs) is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, energy and power. Several group oriented applications over MANETs create new challenges to routing protocols in terms of QOS requirements. In many multicast interactions, due to its frequent node mobility, new member can join and current members can leave at a time. It is necessary to choose a routing protocol which establishes true connectivity between the mobile nodes. The pattern of movement of members is classified into different mobility models and each one has its own distinct features. It is a crucial part in the performance of MANET. Hence key management is the fundamental challenge in achieving secure communication using multicast key distribution for mobile adhoc networks. This paper describes the impact of mobility models for the performance of a new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol in terms of QOS requirements such as end to end delay, energy consumption and key delivery ratio. For simulation purposes, three mobility models are considered. Simulation results illustrate the performance of routing protocol with different mobility models and different mobility speed under varying network conditions.

Impact of Mobility for Qos Based Secure Manet

graphhoc

This paper presents a novel algorithm for clustering of nodes by transmission range based clustering (TRBC).This algorithm does topology management by the usage of coverage area of each node and power management based on mean transmission power within the context of wireless ad-hoc networks. By reducing the transmission range of the nodes, energy consumed by each node is decreased and topology is formed. A new algorithm is formulated that helps in reducing the system power consumption and prolonging the battery life of mobile nodes. Formation of cluster and selection of optimal cluster head and thus forming the optimal cluster taking weighted metrics like battery life, distance, position and mobility is done based on the factors such as node density, coverage area, contention index, required and current node degree of the nodes in the clusters

A Transmission Range Based Clustering Algorithm for Topology Control Manet

graphhoc

A major issue in the ad hoc networks with energy constraints is to find ways that increase their lifetime. The use of multihop radio relaying requires a sufficient number of relaying nodes to maintainnetwork connectivity. Hence, battery power is a precious resource that must be used efficiently in order to avoid early termination of any node. In this paper, a new battery power scheduling policy based on dynamic programming is proposed for mobile devices.This policy makes use of the state information of each cell provided by the smart battery package and uses the strategy of dynamic programming to optimally satisfy a request for power. Using extensive simulation it is proved that dynamic programming based schedulingpolicyimproves the lifetime of the mobile nodes.Also a hardware support is proposed to succeeds in distinguishing between real-time and non-real-time traffic and provides the appropriate grade of service, to meet the time constraints associated with real time traffic.

A Battery Power Scheduling Policy with Hardware Support In Mobile Devices

graphhoc

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanisms.

A Review of the Energy Efficient and Secure Multicast Routing Protocols for ...

graphhoc

There are plenty of security software in market; each claiming the best, still we daily face problem of viruses and other malicious activities. If we know the basic working principal of such malware then we can very easily prevent most of them even without security software. Hackers and crackers are experts in psychology to manipulate people into giving them access or the information necessary to get access. This paper discusses the inner working of such attacks. Case study of Spyware is provided. In this case study, we got 100% success using social engineering techniques for deception on Linux operating system, which is considered as the most secure operating system. Few basic principal of defend, for the individual as well as for the organization, are discussed here, which will prevent most of such attack if followed.

Case Study On Social Engineering Techniques for Persuasion Full Text

graphhoc

In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated

Breaking the Legend: Maxmin Fairness notion is no longer effective

graphhoc

Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding technique which reduces the delay experienced during packet delivery as well as the energy consumed for transmission and reception of data packets.

I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet F...

graphhoc

In sensor networks communication by broadcast methods involves many hazards, especially collision. Several MAC layer protocols have been proposed to resolve the problem of collision namely ARBP, where the best achieved success rate is 90%. We hereby propose a MAC protocol which achieves a greater success rate (Success rate is defined as the percentage of delivered packets at the source reaching the destination successfully) by reducing the number of collisions, but by trading off the average propagation delay of transmission. Our proposed protocols are also shown to be more energy efficient in terms of energy dissipation per message delivery, compared to the currently existing protocol.

Fault tolerant wireless sensor mac protocol for efficient collision avoidance

graphhoc

Managing network complexity, accommodating greater numbers of subscribers, improving coverage to support data services (e.g. email, video, and music downloads), keeping up to speed with fast-changing technology, and driving maximum value from existing networks – all while reducing CapEX and OpEX and ensuring Quality of Service (QoS) for the network and Quality of Experience (QoE) for the user. These are just some of the pressing business issues faced by mobileservice providers, summarized by the demand to “achieve more, for less.” The ultimate goal of optimization techniques at the network and application layer is to ensure End-user perceived QoS. The next generation networks (NGN), a composite environment of proven telecommunications and Internet-oriented mechanisms have become generally recognized as the telecommunications environment of the future. However, the nature of the NGN environment presents several complex issues regarding quality assurance that have not existed in the legacy environments (e.g., multi-network, multi-vendor, and multi-operator IP-based telecommunications environment, distributed intelligence, third-party provisioning, fixed-wireless and mobile access, etc.). In this Research Paper, a service aware policy-based approach to NGN quality assurance is presented, taking into account both perceptual quality of experience and technologydependant quality of service issues. The respective procedures, entities, mechanisms, and profiles are discussed. The purpose of the presented approach is in research, development, and discussion of pursuing the end-to-end controllability of the quality of the multimedia NGN-based communications in an environment that is best effort in its nature and promotes end user’s access agnosticism, service agility, and global mobility

Enhancing qo s and qoe in ims enabled next generation networks

graphhoc

Simulated annealing for location area planning in cellular networks

graphhoc

Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active interfering. The lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. Nodes act both as hosts and routers and are interconnected by Multi- hop communication path for forwarding and receiving packets to/from other nodes. The objective of this paper is to propose a key exchange and encryption mechanism that aims to use the MAC address as an additional parameter as the message specific key[to encrypt]and forward data among the nodes. The nodes are organized in spanning tree fashion, as they avoid forming cycles and exchange of key occurs only with authenticated neighbors in ad hoc networks, where nodes join or leave the network dynamically.

Secure key exchange and encryption mechanism for group communication in wirel...

graphhoc

In recent times the cost of mobile communication has dropped significantly leading to a dramatic increase in mobile phone usage. The widespread usage has led mobiles to emerge as a strong alternative for other applications one of which is tracking. This has enabled law-enforcing agencies to detect overspeeding vehicles and organizations to keep track its employees. The 3 major ways of tracking being employed presently are (a) via GPS [1] (b) signal attenuation property of a packet [3] and (c) using GSM Network [2]. The initial cost of GPS is very high resulting in low usage whereas (b) needs a very high precision measuring device. The paper presents a GSM-based tracking technique which eliminates the above mentioned overheads, implements it in NS2 and shows the limitations of the real life simulation. An accuracy of 97% was achieved during NS2 simulation which is comparable to the above mentioned alternate methods of tracking.

Simulation to track 3 d location in gsm through ns2 and real life

graphhoc

For high data rate ultra wideband communication system, performance comparison of Rake, MMSE and Rake-MMSE receivers is attempted in this paper. Further a detail study on Rake-MMSE time domain equalizers is carried out taking into account all the important parameters such as the effect of the number of Rake fingers and equalizer taps on the error rate performance. This receiver combats inter-symbol interference by taking advantages of both the Rake and equalizer structure. The bit error rate performances are investigated using MATLAB simulation on IEEE 802.15.3a defined UWB channel models. Simulation results show that the bit error rate probability of Rake-MMSE receiver is much better than Rake receiver and MMSE equalizer. Study on non-line of sight indoor channel models illustrates that bit error rate performance of Rake-MMSE (both LE and DFE) improves for CM3 model with smaller spread compared to CM4 channel model. It is indicated that for a MMSE equalizer operating at low to medium SNR values, the number of Rake fingers is the dominant factor to improve system performance, while at high SNR values the number of equalizer taps plays a more significant role in reducing the error rate.

Performance Analysis of Ultra Wideband Receivers for High Data Rate Wireless ...

graphhoc

There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.

Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...

graphhoc

Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it’s an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time , there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this paper, the more representative of routing protocols, analysis of individual characteristics and advantages and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad Hoc Networks

An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applicat...

graphhoc

In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and n −1edge is odd graceful, and the cycle graph Cm with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper, firstly, we studied the graphCm∪Pn when m = 4, 6,8,10 and then we proved that the graphCm∪Pn is odd graceful if m is even. Finally, we described an algorithm to label the vertices and the edges of the vertex set ( ) m n V C ∪P and the edge set ( ) m n E C ∪P .

An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles

graphhoc

A lot of research work has been done in the area of Garbage collection for both uniprocessor and distributed systems. Actors are associated with activity (thread) and hence usual garbage collection algorithms cannot be applied for them. Hence a separate algorithm should be used to collect them. If we transform the active reference graph into a graph which captures all the features of actors and looks like passive reference graph then any passive reference graph algorithm can be applied for it. But the cost of transformation and optimization are the core issues. An attempt has been made to walk through these issues.

ACTOR GARBAGE COLLECTION IN DISTRIBUTED SYSTEMS USING GRAPH TRANSFORMATION

graphhoc

Plus de graphhoc (20)