Continuous increase in urban population causes enormous pressure on the limited resources of cities including transport, energy, water, housing, public services, and others. Hence, the need to plan and develop smart cities-based solutions for enhanced urban governance is becoming more evident. The technological framework for smart cities services connect hundreds of data collecting device networks (e.g., sensor networks) with central server or cloud through Internet. Scheduling of these enormous data (or big data) both at the device networks and central server/cloud is significantly important to facilitate timely and priority-based smart city services. This paper introduces a cloud- based big data framework and Priority-based, Dynamic and Time sensitive data processing and Scheduling (PDTS) approach that works both for the device networks and cloud-based big data framework. Simulation results demonstrate that the proposed PDTS approach reduces the number of data transmission and data processing time as opposed to data scheduling only in cloud-based big data framework.

Key management poses a main concern for security operation in sensor network. Most existing key management schemes try to establish shared keys for all pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and causes large overhead. Recent trend of research mainly consider homogeneous sensor network and a few consider heterogeneous sensor network for key management. In this paper, we consider heterogeneous sensor network (HSN) as a model for our proposed novel key agreement protocol based on pairing identity based encryption (IBE). The proposed scheme reduces the key spaces of the nodes, in fact nodes do not need to store any key of the other nodes rather it computes secret sharing key by using pairing and IBE properties. Security analysis shows, it also robust against different attacks such as replay attack, masquerade attack, and integrity attack.

Distributed object computing (DOG) is an increasingly important computing paradigm exploiting the benefits of object-oriented technology and using the Internet and its communications infrastructure as a vehicle for the delivery of a wide range of sophisticated value-added distributed services. The integration of the Common Object Request Broker Architecture (CORBA) and object oriented programming languages facilitates the introduction and deployment of such applications in a platform-independent open distributed environment. We introduce both CORBA and Java as tools to facilitate the development of distributed object computing-based applications, and we present a prototype electronic commerce application using the DOC paradigm.

We present the design and modeling of an intelligent modular switching architecture, designated MSA, for packet transport over next-generation ultra-dense wavelength division multiplexed (WDM) networks. The proposed architecture reduces the electronic processing overhead in sending the packets from source to destination. This is achieved by sending routing/forwarding information on a dedicated control channel. The control packets are processed electronically by a control processor at each intermediate node. The processing of control packets ensures that the data packets propagate from source to destination in photonic form (that is, without any processing by intermediate nodes). Due to the flexible nature of the proposed architecture it can be applied to support opaque optical networks to all-optical networks and can be used to transport IP/MPLS and ATM traffic. The performance evaluation of the proposed switching architecture shows that it drastically reduces the electronic processing overhead. Saving in the processing overhead can leverage bandwidth utilization without increasing the hardware gear cost. Furthermore, a large saving in terms of electrical-to-optical (E/O) and optical-to-electrical (O/E) converters cost per node can also be achieved.

Reverse engineering and design recovery are two important concepts for the evolutionary design of systems software. In particular, the reverse engineering of distributed software, such as communications systems, is a very challenging, practical problem. Most communications software is written without the use of formal methods and is often poorly documented. Consequently, to maintain or modify such software, relevant details of the original design need to be recovered from the executable software itself. This design recovery process, called reverse engineering, involves either static analysis of the code or dynamic analysis of the software behaviour based on selected execution traces. In this paper, we use the dynamic trace analysis approach. Specifically, based on execution traces as represented at selected points of observation, we generate a higher level design representation consisting of communicating finite state machines (CFSMs) corresponding to the protocol design and service constraints.

Concurrent C (ConcC) [1] is a relatively new language that extends the C programming language [2] by incorporating multitasking facilities. These facilities are mainly based on the bidirectional rendez-vous concept, and they offer flexible and efficient mechanisms for the specification of concurrency, communication and synchronization often required in real-time systems. However, as for most real-time and concurrent programming languages such as Ada [3], the description of multitasking facilities in ConcC is lacking a rigorous and formal semantical definition. Most existing introductory materials to ConcC by its authors are informally described, and cannot be easily understood. In this paper, we explain the semantics of multitasking facilities in ConcC using the Petri net model. As is well known, the Petri net model is a formal graphical model that can describe concurrent behaviours of systems in a natural and intuitive manner, and yet it is based on strong mathematical and semantical foundations. Timed, inhibitor arc and predicate Petri nets are extensions that are used to enhance the expressive power of the basic Petri net to model and explain all ConcC multitasking features.

Eleven methods for the synthesis of communication protocols are described. Based on particular features of the synthesis process, these methods are classified and compared. In particular, it is noted that interactive methods allow flexibility in the design process; as a result, communication patterns are not prespecified but may be constructed interactively. Methods that only consider the synchronous mode of behavior of communicating entities exclude a wide range of real-life protocols. Methods that make no reference to service requirements do not guarantee the semantic correctness of the synthesized protocol and therefore require the application of a semantic verification procedure. Most methods concentrate on the synthesis of the control part of the protocol entities, which mainly consists of the exchange of synchronization messages. The data part is not adequately treated by any of the synthesis methods. Other than the exchange of synchronization messages, some methods have been extended to deal with unreliable media by synthesizing error-recovery patterns. Some new research directions for enhancing the applicability of the synthesis approach to the design of real-life protocols are obtained.>