Abstract: A mobile ad hoc network (MANET) is a self configuring network, without any centralized control. The topology of this network is not always defined. The main objective of this paper is to introduce the fundamental concepts of MANETs to the researchers and practitioners, who are involved in the work in the area of modeling and simulation of MANETs. This paper begins with an overview of mobile ad hoc networks. Then it proceeds with the overview of routing protocols used in the MANETS, their properties and simulation methods. A brief tabular comparison between the routing protocols is also given in this paper considering different routing protocol parameters. This paper introduces a new routing scheme developed by the use of evolutionary algorithms (EA) and analytical hierarchy process (AHP) which will be used for getting the optimized output of MANET. In this paper cryptographic technique, ceaser cipher is also employed for making the optimized route secure.
Abstract: In this paper we focus on the Round Trip Delay (RTD) time measurement technique which is an easy way to obtain the operating condition information in wireless network (WN). RTD measurement is affected by various parameters of wireless network. We illustrate how these RTD parameters vary (in a telemanagement application) versus distance, baud rates, number of hops, between nodes, using radio modem & router unit as a means of transmission and wireless routing.
Abstract: The travelling salesman problem (TSP) is a combinatorial optimization problem in which the goal is to find the shortest path between different cities that the salesman takes. In other words, the problem deals with finding a route covering all cities so that total distance and execution time is minimized. This paper adopts the nearest neighbor and minimum spanning tree algorithm to solve the well-known travelling salesman problem. The algorithms were implemented using java programming language. The approach is tested on three graphs that making a TSP tour instance of 5-city, 10 –city, and 229–city. The computation results validate the performance of the proposed algorithm.
Abstract: This paper presents the design, implementation and evaluation of a micro-network, or Network-on-Chip (NoC), based on a generic pipeline router architecture. The router is designed to efficiently support traffic generated by multimedia applications on embedded multi-core systems. It employs a simplest routing mechanism and implements the round-robin scheduling strategy to resolve output port contentions and minimize latency. A virtual channel flow control is applied to avoid the head-of-line blocking problem and enhance performance in the NoC. The hardware design of the router architecture has been implemented at the register transfer level; its functionality is evaluated in the case of the two dimensional Mesh/Torus topology, and performance results are derived from ModelSim simulator and Xilinx ISE 9.2i synthesis tool. An example of a multi-core image processing system utilizing the NoC structure has been implemented and validated to demonstrate the capability of the proposed micro-network architecture. To reduce complexity of the image compression and decompression architecture, the system use image processing algorithm based on classical discrete cosine transform with an efficient zonal processing approach. The experimental results have confirmed that both the proposed image compression scheme and NoC architecture can achieve a reasonable image quality with lower processing time.
Abstract: Changes in the sensory, chemical and microbiological quality of the Mediterranean hake during post-catch handling and distribution were investigated. 115 fish samples were seasonally received during three stages of the transfer route from the sea to the consumer and two storage methods were recorded, seawater and ice storage. Microbiological evaluation revealed higher status for the ice stored samples regarding heterotrophic bacteria (2.68 log cfu/g and 1.92 log cfu/g at 22oC and 37°C respectively) and psychrotrophic counts (3.20 log cfu/g), with statistically significant differences among storage methods. Sensory evaluation also revealed higher status for the ice stored samples with a mean quality index of 0.17 and a spoilage time estimated at 30 hours, in contrast to seawater storage, which varied from 0.28 to 0.3, and a 14-hour estimated spoilage. Detected pathogens were identified mainly in the seawater stored samples, posing questions on the quality of the product reaching the seafood markets.
Abstract: The performance of state of the art worldwide telecommunication networks strongly depends on the efficiency of the applied routing mechanism. Game theoretical approaches to this problem offer new solutions. In this paper a new continuous network routing model is defined to describe data transfer in fixed telecommunication networks of multiple hosts. The nodes of the network correspond to routers whose latency is assumed to be traffic dependent. We propose that the whole traffic of the network can be decomposed to a finite number of tasks, which belong to various hosts. To describe the different latency-sensitivity, utility functions are defined for each task. The model is used to compare router and host intelligent types of routing methods, corresponding to various data transfer protocols. We analyze host intelligent routing as a transferable utility cooperative game with externalities. The main aim of the paper is to provide a framework in which the efficiency of various routing algorithms can be compared and the transferable utility game arising in the cooperative case can be analyzed.
Abstract: There are many classical algorithms for finding
routing in FPGA. But Using DNA computing we can solve the routes
efficiently and fast. The run time complexity of DNA algorithms is
much less than other classical algorithms which are used for solving
routing in FPGA. The research in DNA computing is in a primary
level. High information density of DNA molecules and massive
parallelism involved in the DNA reactions make DNA computing a
powerful tool. It has been proved by many research accomplishments
that any procedure that can be programmed in a silicon computer can
be realized as a DNA computing procedure. In this paper we have
proposed two tier approaches for the FPGA routing solution. First,
geometric FPGA detailed routing task is solved by transforming it
into a Boolean satisfiability equation with the property that any
assignment of input variables that satisfies the equation specifies a
valid routing. Satisfying assignment for particular route will result in
a valid routing and absence of a satisfying assignment implies that
the layout is un-routable. In second step, DNA search algorithm is
applied on this Boolean equation for solving routing alternatives
utilizing the properties of DNA computation. The simulated results
are satisfactory and give the indication of applicability of DNA
computing for solving the FPGA Routing problem.
Abstract: In this paper the influence of heterogeneous traffic on
the temporal variation of ambient PM10, PM2.5 and PM1
concentrations at a busy arterial route (Sardar Patel Road) in the
Chennai city has been analyzed. The hourly PM concentration, traffic
counts and average speed of the vehicles have been monitored at the
study site for one week (19th-25th January 2009). Results indicated
that the concentrations of coarse (PM10) and fine PM (PM2.5 and
PM1) concentrations at SP road are having similar trend during peak
and non-peak hours, irrespective of the days. The PM concentrations
showed daily two peaks corresponding to morning (8 to 10 am) and
evening (7 to 9 pm) peak hour traffic flow. The PM10 concentration is
dominated by fine particles (53% of PM2.5 and 45% of PM1). The
high PM2.5/PM10 ratio indicates that the majority of PM10 particles
originate from re-suspension of road dust. The analysis of traffic flow
at the study site showed that 2W, 3W and 4W are having similar
diurnal trend as PM concentrations. This confirms that the 2W, 3W
and 4W are the main emission source contributing to ambient PM
concentration at SP road. The speed measurement at SP road showed
that the average speed of 2W, 3W, 4W, LCV and HCV are 38, 40,
38, 40 and 38 km/hr and 43, 41, 42, 40 and 41 km/hr respectively for
the weekdays and weekdays.
Abstract: The Mobile IP Standard has been developed to support mobility over the Internet. This standard contains several drawbacks as in the cases where packets are routed via sub-optimal paths and significant amount of signaling messages is generated due to the home registration procedure which keeps the network aware of the current location of the mobile nodes. Recently, a dynamic hierarchical mobility management strategy for mobile IP networks (DHMIP) has been proposed to reduce home registrations costs. However, this strategy induces a packet delivery delay and increases the risk of packet loss. In this paper, we propose an enhanced version of the dynamic hierarchical strategy that reduces the packet delivery delay and minimizes the risk of packet loss. Preliminary results obtained from simulations are promising. They show that the enhanced version outperforms the original dynamic hierarchical mobility management strategy version.
Abstract: The radius-of-curvature (ROC) defines the degree of
curvature along the centerline of a roadway whereby a travelling
vehicle must follow. Roadway designs must encompass ROC in
mitigating the cost of earthwork associated with construction while
also allowing vehicles to travel at maximum allowable design speeds.
Thus, a road will tend to follow natural topography where possible,
but curvature must also be optimized to permit fast, but safe vehicle
speeds. The more severe the curvature of the road, the slower the
permissible vehicle speed. For route planning, whether for urban
settings, emergency operations, or even parcel delivery, ROC is a
necessary attribute of road arcs for computing travel time.
It is extremely rare for a geo-spatial database to contain ROC. This
paper will present a procedure and mathematical algorithm to
calculate and assign ROC to a segment pair and/or polyline.
Abstract: Voice Over IP (VoIP) is a technology that could pass
the voice traffic and data packet form over an IP network. Network
can be used for intranet or Internet. Phone calls using VoIP has
advantages in terms of cheaper cost of PSTN phone to more than
half, because the cost is calculated by the cost of the global nature of
the Internet. Session Initiation Protocol (SIP) is a signaling protocol
at the application layer which serves to establish, modify, and
terminate a multimedia session involving one or more users. This SIP
signaling has SIP message in text form that is used for session
management by the SIP components, such as User Agent, Registrar,
Redirect Server, and Proxy Server. To build a SIP communication is
required SIP Express Router (SER) to be able to receive SIP
messages, for handling the basic functions of SIP messages.
Problems occur when the NAT through which affects the voice
communication will be blocked starting from the sound that is not
sent or one side of the sound are sent (half duplex). How that could
be used to penetrate NAT is to use a given mediaproxy random RTP
port to penetrate NAT.
Abstract: Strategic alliances generally mean the cooperation or
collaboration between firms which pursue for a synergy that each
member hopes the benefits from the alliances would be much more
than those from individual efforts. Past researches provide us
sufficient theories and considerations for alliance forming in liner
shipping market. This research reviews important academic journals
for the past decade regarding to the most important reasons to form the
alliances. We would explain the motive of alliances and details of
shipping cooperation in literature review.
The paper also empirically investigates the key service quality
requirements improved through alliances by using quality function
deployment (QFD). Moreover, the research investigates famous
shipping reports, shipping consultant websites and most recent
shipping publications to find out the executive-s viewpoint of several
leading carriers among top 20 to assess current shipping strategic
alliance on Asia/Europe route. These comments provide meaningful
managerial reasons to consider alliance formations and search if there
is any gap between the theories and industrial practice. Analysis of the
empirical investigation and top management-s perspective on current
market situation will contribute us some meaningful managerial
suggestions to evaluate these theories applied to current strategic
alliances.
Abstract: The purpose of this research was to study the behavior
trend factors of consumers to roasted coffee at the petrol station on
the route of Rangsit to Nakhon Nayok. The research drew upon data
collected from the regular consumers of roasted coffee stands. The
majority of respondents was male, 33-39 years old, and holding a
bachelor degree. The majority of respondents considered themselves
private business proprietors or entrepreneurs and had a monthly
income of between 10,000-16,000 baht. The regular coffee
consumers spent a minimum coffee expense of between 45 and 300
baht per day. These consumers also displayed good attitude and good
motivation which can be ranked as very high. From the hypothesis
testing of the behavior trend for the roasted coffee consumers in
repurchasing coffee and recommended the coffee to others, the
findings revealed that it had a significant correlation. Moreover, the
overall attitude towards the marketing mix factors also had a
significant correlation with the behavior trend consumers.
Abstract: A novel idea presented in this paper is to combine
multihop routing with single-frequency networks (SFNs) for a
broadcasting scenario. An SFN is a set of multiple nodes that transmit
the same data simultaneously, resulting in transmitter macrodiversity.
Two of the most important performance factors of multihop
networks, node reachability and routing robustness, are analyzed.
Simulation results show that our proposed SFN-D routing algorithm
improves the node reachability by 37 percentage points as compared
to non-SFN multihop routing. It shows a diversity gain of 3.7 dB,
meaning that 3.7 dB lower transmission powers are required for the
same reachability. Even better results are possible for larger
networks. If an important node becomes inactive, this algorithm can
find new routes that a non-SFN scheme would not be able to find.
Thus, two of the major problems in multihopping are addressed;
achieving robust routing as well as improving node reachability or
reducing transmission power.
Abstract: In the paper we discuss the influence of the route
flexibility degree, the open rate of operations and the production type
coefficient on makespan. The flexible job-open shop scheduling
problem FJOSP (an extension of the classical job shop scheduling) is
analyzed. For the analysis of the production process we used a
hybrid heuristic of the GRASP (greedy randomized adaptive search
procedure) with simulated annealing algorithm. Experiments with
different levels of factors have been considered and compared. The
GRASP+SA algorithm has been tested and illustrated with results for
the serial route and the parallel one.
Abstract: Preparation of size controlled nano-particles of silver catalyst on carbon substrate from e-waste has been investigated. Chemical route was developed by extraction of the metals available in nitric acid followed by treatment with hydrofluoric acid. Silver metal particles deposited with an average size 4-10 nm. A stabilizer concentration of 10- 40 g/l was used. The average size of the prepared silver decreased with increase of the anode current density. Size uniformity of the silver nano-particles was improved distinctly at higher current density no more than 20mA... Grain size increased with EK time whereby aggregation of particles was observed after 6 h of reaction.. The chemical method involves adsorption of silver nitrate on the carbon substrate. Adsorbed silver ions were directly reduced to metal particles using hydrazine hydrate. Another alternative method is by treatment with ammonia followed by heating the carbon loaded-silver hydroxide at 980°C. The product was characterized with the help of XRD, XRF, ICP, SEM and TEM techniques.
Abstract: In IETF RFC 2002, Mobile-IP was developed to
enable Laptobs to maintain Internet connectivity while moving
between subnets. However, the packet loss that comes from
switching subnets arises because network connectivity is lost while
the mobile host registers with the foreign agent and this encounters
large end-to-end packet delays. The criterion to initiate a simple and
fast full-duplex connection between the home agent and foreign
agent, to reduce the roaming duration, is a very important issue to be
considered by a work in this paper. State-transition Petri-Nets of the
modeling scenario-based CIA: communication inter-agents procedure
as an extension to the basic Mobile-IP registration process was
designed and manipulated to describe the system in discrete events.
The heuristic of configuration file during practical Setup session for
registration parameters, on Cisco platform Router-1760 using IOS
12.3 (15)T and TFTP server S/W is created. Finally, stand-alone
performance simulations from Simulink Matlab, within each subnet
and also between subnets, are illustrated for reporting better end-toend
packet delays. Results verified the effectiveness of our Mathcad
analytical manipulation and experimental implementation. It showed
lower values of end-to-end packet delay for Mobile-IP using CIA
procedure-based early registration. Furthermore, it reported packets
flow between subnets to improve losses between subnets.
Abstract: Multi-Radio Multi-Channel Wireless Mesh Networks (MRMC-WMNs) operate at the backbone to access and route high volumes of traffic simultaneously. Such roles demand high network capacity, and long “online" time at the expense of accelerated transmission energy depletion and poor connectivity. This is the problem of transmission power control. Numerous power control methods for wireless networks are in literature. However, contributions towards MRMC configurations still face many challenges worth considering. In this paper, an energy-efficient power selection protocol called PMMUP is suggested at the Link-Layer. This protocol first divides the MRMC-WMN into a set of unified channel graphs (UCGs). A UCG consists of multiple radios interconnected to each other via a common wireless channel. In each UCG, a stochastic linear quadratic cost function is formulated. Each user minimizes this cost function consisting of trade-off between the size of unification states and the control action. Unification state variables come from independent UCGs and higher layers of the protocol stack. The PMMUP coordinates power optimizations at the network interface cards (NICs) of wireless mesh routers. The proposed PMMUP based algorithm converges fast analytically with a linear rate. Performance evaluations through simulations confirm the efficacy of the proposed dynamic power control.
Abstract: An attempt has been made to investigate the
machinability of zirconia toughened alumina (ZTA) inserts while
turning AISI 4340 steel. The insert was prepared by powder
metallurgy process route and the machining experiments were
performed based on Response Surface Methodology (RSM) design
called Central Composite Design (CCD). The mathematical model of
flank wear, cutting force and surface roughness have been developed
using second order regression analysis. The adequacy of model has
been carried out based on Analysis of variance (ANOVA) techniques.
It can be concluded that cutting speed and feed rate are the two most
influential factor for flank wear and cutting force prediction. For
surface roughness determination, the cutting speed & depth of cut
both have significant contribution. Key parameters effect on each
response has also been presented in graphical contours for choosing
the operating parameter preciously. 83% desirability level has been
achieved using this optimized condition.
Abstract: Mobile ad hoc network is a collection of mobile
nodes communicating through wireless channels without any existing
network infrastructure or centralized administration. Because of the
limited transmission range of wireless network interfaces, multiple
"hops" may be needed to exchange data across the network. In order
to facilitate communication within the network, a routing protocol is
used to discover routes between nodes. The primary goal of such an
ad hoc network routing protocol is correct and efficient route
establishment between a pair of nodes so that messages may be
delivered in a timely manner. Route construction should be done
with a minimum of overhead and bandwidth consumption. This paper
examines two routing protocols for mobile ad hoc networks– the
Destination Sequenced Distance Vector (DSDV), the table- driven
protocol and the Ad hoc On- Demand Distance Vector routing
(AODV), an On –Demand protocol and evaluates both protocols
based on packet delivery fraction, normalized routing load, average
delay and throughput while varying number of nodes, speed and
pause time.